| Package | Description |
|---|---|
| com.vividsolutions.jts.triangulate |
Classes to compute Delaunay triangulations.
|
| Modifier and Type | Method and Description |
|---|---|
ConstraintVertex |
ConstraintVertexFactory.createVertex(Coordinate
|
boolean |
Segment.equalsTopo(Segment
Determines whether two segments are topologically equal.
|
Coordinate |
NonEncroachingSplitPointFinder.findSplitPoint(Segment
A basic strategy for finding split points when nothing extra is known about the geometry of the situation.
|
Coordinate |
MidpointSplitPointFinder.findSplitPoint(Segment
Gets the midpoint of the split segment
|
Coordinate |
ConstraintSplitPointFinder.findSplitPoint(Segment
Finds a point at which to split an encroached segment to allow the original segment to appear as edges in a constrained Delaunay triangulation.
|
Coordinate |
Segment.intersection(Segment
Computes the intersection point between this segment and another one.
|
static Coordinate |
NonEncroachingSplitPointFinder.projectedSplitPoint(Segment
Computes a split point which is the projection of the encroaching point on the segment
|