Delaunay 2D Cdt

Functionality

Computes the Constrained Delaunay Triangulation of a set of vertices, with edges and faces that must appear in the triangulation. Some triangles may be eaten away, or combined with other triangles, according to output type. The returned verts may be in a different order from input verts, may be moved slightly, and may be merged with other nearby verts.

Category

Modifiers -> Modifier make -> Delaunay 2D Cdt

Inputs

• Verts - vertices of given mesh(es)

• Edges - edges of given mesh(es)

• Faces - faces of given mesh(es)

• Face data (optional, one value per face of mesh) - Any data related with given faces.

Outputs

• Verts - vertices, some can be deleted

• Edges - new and old edges

• Faces - new and old faces

• Face data - filtered according topology changes given face data if was give one or indexes of old faces

Modes

• Convex - given mesh will be triangulated into bounding convex face

• Inside - all parts outside given faces or closed edge loops will be ignored by triangulation algorithm

N panel

• Epsilon - For nearness tests; number of figures after coma

Examples

Combine of a line and random points into Delaunay triangulation:

• Generator-> Segment

• Generator-> Random Vector

• List->List Main-> List Join

• Viz-> Viewer Draw

---

Triangulation of points inside given face:

• Scene-> Get Objects Data

• Spatial-> Populate Mesh

• List->List Main-> List Join

• Viz-> Viewer Draw

---

Keeping color initial faces:

• Generator-> Plane

• Spatial-> Populate Mesh

• Number-> Random Num Gen

• List->List Main-> List Length

• Color-> Color In

• Viz-> Viewer Draw

• Viz-> Mesh Viewer

• BPY Date-> Vertex Color MK3 (No docs)