Class IncrementalDelaunayTriangulator

Computes a Delaunay Triangulation of a set of Vertexes, using an incremental insertion algorithm.

Inheritance

object

IncrementalDelaunayTriangulator

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Namespace: NetTopologySuite.Triangulate

Assembly: NetTopologySuite.dll

Syntax

public class IncrementalDelaunayTriangulator

Constructors

IncrementalDelaunayTriangulator(QuadEdgeSubdivision)

Creates a new triangulator using the given QuadEdgeSubdivision. The triangulator uses the tolerance of the supplied subdivision.

Declaration

public IncrementalDelaunayTriangulator(QuadEdgeSubdivision subdiv)

Parameters

Type	Name	Description
QuadEdgeSubdivision	subdiv	a subdivision in which to build the TIN

Properties

ForceConvex

Gets or sets whether the triangulation is forced to have a convex boundary. Because of the use of a finite-size frame, this condition requires special logic to enforce.The default is true, since this is a requirement for some uses of Delaunay Triangulations (such as Concave Hull generation). However, forcing the triangulation boundary to be convex may cause the overall frame triangulation to be non-Delaunay.This can cause a problem for Voronoi generation, so the logic can be disabled via this method.

Declaration

public bool ForceConvex { get; set; }

Property Value

Type	Description
bool

Methods

InsertSite(Vertex)

Inserts a new point into a subdivision representing a Delaunay triangulation, and fixes the affected edges so that the result is still a Delaunay triangulation.

Declaration

public QuadEdge InsertSite(Vertex v)

Parameters

Type	Name	Description
Vertex	v

Returns

Type	Description
QuadEdge	a quadedge containing the inserted vertex

InsertSites(ICollection<Vertex>)

Inserts all sites in a collection. The inserted vertices MUST be unique up to the provided tolerance value. (i.e. no two vertices should be closer than the provided tolerance value). They do not have to be rounded to the tolerance grid, however.

Declaration

public void InsertSites(ICollection<Vertex> vertices)

Parameters

Type	Name	Description
ICollection<Vertex>	vertices	a Collection of Vertex

Exceptions

Type	Condition
LocateFailureException	if the location algorithm fails to converge in a reasonable number of iterations