public class IncrementalDelaunayTriangulator
extends java.lang.Object
Vertex
es, using an
incremental insertion algorithm.Constructor | Description |
---|---|
IncrementalDelaunayTriangulator(QuadEdgeSubdivision subdiv) |
Creates a new triangulator using the given
QuadEdgeSubdivision . |
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(java.util.Collection vertices) |
Inserts all sites in a collection.
|
public IncrementalDelaunayTriangulator(QuadEdgeSubdivision subdiv)
QuadEdgeSubdivision
.
The triangulator uses the tolerance of the supplied subdivision.subdiv
- a subdivision in which to build the TINpublic void insertSites(java.util.Collection vertices)
vertices
- a Collection of VertexLocateFailureException
- if the location algorithm fails to converge in a reasonable number of iterationsCopyright © 2018. All rights reserved.