Class IncrementalDelaunayTriangulator

java.lang.Object

org.locationtech.jts.triangulate.IncrementalDelaunayTriangulator

public class IncrementalDelaunayTriangulator
extends Object

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

Version:

1.0

Author:

Martin Davis

Constructor Summary

Constructors

Constructor	Description
IncrementalDelaunayTriangulator(QuadEdgeSubdivision subdiv)	Creates a new triangulator using the given QuadEdgeSubdivision.

Method Summary

Modifier and Type	Method	Description
QuadEdge	insertSite(Vertex v)	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.
void	insertSites(Collection vertices)	Inserts all sites in a collection.

Methods inherited from class Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

IncrementalDelaunayTriangulator

public IncrementalDelaunayTriangulator(QuadEdgeSubdivision subdiv)

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

Parameters:

subdiv - a subdivision in which to build the TIN

Method Details

insertSites

public void insertSites(Collection vertices)

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.

Parameters:

vertices - a Collection of Vertex

Throws:

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

insertSite

public QuadEdge insertSite(Vertex v)

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.

Returns:

a quadedge containing the inserted vertex