Package Summary
Classes to implement a topological subdivision of quadeges, to support creating triangulations and Voronoi diagrams.
Interface Summary
An interface for strategies for determining the location of split points on constraint segments.
Class Summary
A utility class which creates Conforming Delaunay Trianglulations from collections of points and linear constraints, and extract the resulting triangulation edges or triangles as geometries.
Computes a Conforming Delaunay Triangulation over a set of sites and a set of linear constraints.
A vertex in a Constrained Delaunay Triangulation.
A utility class which creates Delaunay Trianglulations from collections of points and extract the resulting triangulation edges or triangles as geometries.
Computes a Delauanay Triangulation of a set of
Vertexes, using an incrementatal insertion algorithm.
A simple split point finder which returns the midpoint of the split segment.
A strategy for finding constraint split points which attempts to maximise the length of the split segments while preventing further encroachment.
Models a constraint segment in a triangulation.
Models a constraint segment which can be split in two in various ways, according to certain geometric constraints.
Creates a map between the vertex
Coordinates of a set of
Geometrys, and the parent geometry, and transfers the source geometry data objects to geometry components tagged with the coordinates.
A utility class which creates Voronoi Diagrams from collections of points.
Exception Summary
Indicates a failure during constraint enforcement.
Package com.vividsolutions.jts.triangulate Description
Classes to compute Delaunay triangulations.