Package org.locationtech.jts.triangulate
Class IncrementalDelaunayTriangulator
java.lang.Object
org.locationtech.jts.triangulate.IncrementalDelaunayTriangulator
Computes a Delaunay Triangulation of a set of
Vertex
es, using an
incremental insertion algorithm.- Version:
- 1.0
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptioninsertSite
(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.
-
Field Details
-
subdiv
-
isUsingTolerance
private boolean isUsingTolerance
-
-
Constructor Details
-
IncrementalDelaunayTriangulator
Creates a new triangulator using the givenQuadEdgeSubdivision
. The triangulator uses the tolerance of the supplied subdivision.- Parameters:
subdiv
- a subdivision in which to build the TIN
-
-
Method Details
-
insertSites
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
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
-