Package org.locationtech.jts.triangulate
Classes to compute Delaunay triangulations.
-
Interface Summary Interface Description ConstraintSplitPointFinder An interface for strategies for determining the location of split points on constraint segments.ConstraintVertexFactory An interface for factories which create aConstraintVertex
-
Class Summary Class Description ConformingDelaunayTriangulationBuilder A utility class which creates Conforming Delaunay Triangulations from collections of points and linear constraints, and extract the resulting triangulation edges or triangles as geometries.ConformingDelaunayTriangulator Computes a Conforming Delaunay Triangulation over a set of sites and a set of linear constraints.ConstraintVertex A vertex in a Constrained Delaunay Triangulation.DelaunayTriangulationBuilder A utility class which creates Delaunay Triangulations from collections of points and extract the resulting triangulation edges or triangles as geometries.IncrementalDelaunayTriangulator Computes a Delaunay Triangulation of a set ofVertex
es, using an incremental insertion algorithm.MidpointSplitPointFinder A simple split point finder which returns the midpoint of the split segment.NonEncroachingSplitPointFinder A strategy for finding constraint split points which attempts to maximise the length of the split segments while preventing further encroachment.Segment Models a constraint segment in a triangulation.SplitSegment Models a constraint segment which can be split in two in various ways, according to certain geometric constraints.VertexTaggedGeometryDataMapper Creates a map between the vertexCoordinate
s of a set ofGeometry
s, and the parent geometry, and transfers the source geometry data objects to geometry components tagged with the coordinates.VoronoiDiagramBuilder A utility class which creates Voronoi Diagrams from collections of points. -
Exception Summary Exception Description ConstraintEnforcementException Indicates a failure during constraint enforcement.