|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Segment | |
---|---|
com.vividsolutions.jts.triangulate | Classes to compute Delaunay triangulations. |
Uses of Segment in com.vividsolutions.jts.triangulate |
---|
Methods in com.vividsolutions.jts.triangulate with parameters of type Segment | |
---|---|
ConstraintVertex |
ConstraintVertexFactory.createVertex(Coordinate p,
Segment constraintSeg)
|
boolean |
Segment.equalsTopo(Segment s)
Determines whether two segments are topologically equal. |
Coordinate |
NonEncroachingSplitPointFinder.findSplitPoint(Segment seg,
Coordinate encroachPt)
A basic strategy for finding split points when nothing extra is known about the geometry of the situation. |
Coordinate |
MidpointSplitPointFinder.findSplitPoint(Segment seg,
Coordinate encroachPt)
Gets the midpoint of the split segment |
Coordinate |
ConstraintSplitPointFinder.findSplitPoint(Segment seg,
Coordinate encroachPt)
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 s)
Computes the intersection point between this segment and another one. |
static Coordinate |
NonEncroachingSplitPointFinder.projectedSplitPoint(Segment seg,
Coordinate encroachPt)
Computes a split point which is the projection of the encroaching point on the segment |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |