Computes the 2d Delaunay triangulation of n points in O(n*log(n)) time.
Namespace:
ceometric.ComputationalGeometryAssembly: ceometric.ComputationalGeometry (in ceometric.ComputationalGeometry.dll) Version: 2.4.0.0 (2.4.0.0)
Syntax
| C# |
|---|
public void Triangulate() |
| Visual Basic (Declaration) |
|---|
Public Sub Triangulate |
| Visual C++ |
|---|
public: void Triangulate() |
Remarks
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.
Exceptions
| Exception | Condition |
|---|---|
| System..::.InvalidOperationException | The TriangulationPoints-property has not been set before. |
| System..::.IndexOutOfRangeException | The are less than three TriangulationPoints. |
See Also
