Provides an exact arithmetic 2d constraint Delaunay triangulation of points and constraints.Namespace: ceometric.ComputationalGeometry
Assembly: ceometric.ComputationalGeometry (in ceometric.ComputationalGeometry.dll) Version: 22.214.171.124 (126.96.36.199)
The triangulation doesn't support multiple points with the same planar location, nor does it support multiple points. Use RemoveMultiplePoints2d()()() to eliminate such points. Vertex-lists with duplicate points may result in strange triangulation with intersecting edges or may cause the algorithm to fail. Constraints are edges connecting two triangulation vertices in the XY projection. More precisely, the XY coordinates of both start and end point of a constraint must match the XY coordinates of an existing triangulation point or the constraint will not be inserted at all (constraints that have not been inserted are listed in the BadConstraint list). A constraint Delaunay triangulation will not make constraints become directly part of the triangulation with its x,y and z coordinate values. Instead, constraints will become part of the triangulation so that no triangle will cross a constraint in the XY projection (Z-values of the constraints are ignored). Unlike a conforming Delaunay triangulation, a constraint Delaunay triangulation only operates on the existing triangulation points and no additional triangulation points will be inserted. This behavior is favourable if the initial triangulation point data must not be modified by the triangulation (e.g. site measurements in civil engineering). However, this comes at the cost of losing the Delaunay property.