Download page proudly says you can't downlod it, and you are instead required to interpret the proprietary project format, guess your way around til you find some source examples, and reverse-engineer the instructions. : basic triangulations (Section Basic Triangulations), Delaunay triangulations (Section Delaunay Triangulations), regular triangulations (Section Regular Triangulations), constrained triangulations (Section Constrained Triangulations), and constrained Delaunay triangulations (Section Constrained Delaunay Triangulations).At last, Section Flexibility explains how the user can benefit from the flexibility of The dimension \( d\) of a simplicial complex is the maximal dimension of its simplices.A simplicial complex \( T\) is pure if any simplex of \( T\) is included in a simplex of \( T\) with maximal dimension.Section 35.9 describes a class which implements a constrained or constrained Delaunay triangulation with an additional data structure to describe how the constraints are refined by the edges of the triangulations.Section 35.10 describes a hierarchical data structure for fast point location queries.On top of this data structure, the 2D triangulations classes take care of the geometric embedding of the triangulation and are designed to handle planar triangulations. NET implementation which builds Delaunay triangulation from set of points.
The data structure underlying triangulations allows to represent the combinatorics of any orientable two dimensional triangulations without boundaries.
Each facet of a triangulation can be given an orientation which in turn induces an orientation on the edges incident to that facet.
The orientation of two adjacent facets are said to be consistent if they induce opposite orientations on their common incident edge.
Math Works does not warrant, and disclaims all liability for, the accuracy, suitability, or fitness for purpose of the translation.
: basic triangulations (section 35.4), Delaunay triangulations (Section 35.5), regular triangulations (Section 35.6), constrained triangulations (Section 35.7), and constrained Delaunay triangulations (Section 35.8).