Computes the 2d Delaunay triangulation of n points in O(n*log(n)) time.Namespace: ceometric.ComputationalGeometry
Assembly: ceometric.ComputationalGeometry (in ceometric.ComputationalGeometry.dll) Version: 126.96.36.199 (188.8.131.52)
public void Triangulate()
|Visual Basic (Declaration)|
Public Sub Triangulate
public: void Triangulate()
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. Uses a randomized incremental algorithm due to Guibas et. al. Runs in O(n * log(n)) expected time, using O(n) expected storage. Uses exact arithmetic predicates for ultimate robustness.