Summary
Triangulation-related routines.
Static methods
| IEnumerable<TriangleD> | |
Constructs a Delaunay triangulation of the vertices. |
| IEnumerable<TriangleD> | |
Constructs a Delaunay-like triangulation constrained to contain all edges listed in requiredEdges. The implementation is naive and very slow for larger meshes, because instead of
incrementally re-triangulating only the affected triangles upon an edge split, it performs a full
triangulation every time. |