Class ConstrainedDelaunayTriangulator

Computes the Constrained Delaunay Triangulation of polygons. The Constrained Delaunay Triangulation of a polygon is a set of triangles covering the polygon, with the maximum total interior angle over all possible triangulations. It provides the "best quality" triangulation of the polygon.

Holes are supported.

Inheritance

object

ConstrainedDelaunayTriangulator

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Namespace: NetTopologySuite.Triangulate.Polygon

Assembly: NetTopologySuite.dll

Syntax

public class ConstrainedDelaunayTriangulator

Constructors

ConstrainedDelaunayTriangulator(Geometry)

Constructs a new Constrained Delaunay triangulator.

Declaration

public ConstrainedDelaunayTriangulator(Geometry inputGeom)

Parameters

Type	Name	Description
Geometry	inputGeom	The input geometry

Methods

GetResult()

Gets the triangulation as a GeometryCollection of triangular NetTopologySuite.Triangulate.Polygons.

Declaration

public Geometry GetResult()

Returns

Type	Description
Geometry	A collection of the result triangle polygons

GetTriangles()

Gets the triangulation as a list of Tris.

Declaration

public IList<Tri> GetTriangles()

Returns

Type	Description
IList<Tri>	The list of Tris in the triangulation

Triangulate(Geometry)

Computes the Constrained Delaunay Triangulation of each polygon element in a geometry.

Declaration

public static Geometry Triangulate(Geometry geom)

Parameters

Type	Name	Description
Geometry	geom	The input geometry

Returns

Type	Description
Geometry	A GeometryCollection of the computed triangle polygons