|
JTS Topology Suite version 1.12 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object com.vividsolutions.jts.triangulate.IncrementalDelaunayTriangulator
public class IncrementalDelaunayTriangulator
Computes a Delauanay Triangulation of a set of Vertex
es, using an
incrementatal insertion algorithm.
Constructor Summary | |
---|---|
IncrementalDelaunayTriangulator(QuadEdgeSubdivision subdiv)
Creates a new triangulator using the given QuadEdgeSubdivision . |
Method Summary | |
---|---|
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(java.util.Collection vertices)
Inserts all sites in a collection. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public IncrementalDelaunayTriangulator(QuadEdgeSubdivision subdiv)
QuadEdgeSubdivision
.
The triangulator uses the tolerance of the supplied subdivision.
subdiv
- a subdivision in which to build the TINMethod Detail |
---|
public void insertSites(java.util.Collection vertices)
vertices
- a Collection of Vertex
LocateFailureException
- if the location algorithm fails to converge in a reasonable number of iterationspublic QuadEdge insertSite(Vertex v)
|
JTS Topology Suite version 1.12 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |