Uses of Class
org.locationtech.jts.triangulate.Segment

Packages that use Segment

Package	Description
org.locationtech.jts.triangulate	Classes to compute Delaunay triangulations.

Uses of Segment in org.locationtech.jts.triangulate

Methods in org.locationtech.jts.triangulate with parameters of type Segment

Modifier and Type	Method	Description
private ConstraintVertex	ConformingDelaunayTriangulator.createVertex(Coordinate p, Segment seg)	Creates a vertex on a constraint segment
ConstraintVertex	ConstraintVertexFactory.createVertex(Coordinate p, Segment constraintSeg)
boolean	Segment.equalsTopo(Segment s)	Determines whether two segments are topologically equal.
private Coordinate	ConformingDelaunayTriangulator.findNonGabrielPoint(Segment seg)	Given a set of points stored in the kd-tree and a line segment defined by two points in this set, finds a Coordinate in the circumcircle of the line segment, if one exists.
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	MidpointSplitPointFinder.findSplitPoint(Segment seg, Coordinate encroachPt)	Gets the midpoint of the split segment
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	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