Package | Description |
---|---|
org.locationtech.jts.algorithm.distance |
Classes to compute distance metrics between geometries.
|
org.locationtech.jts.geom |
Contains the
Geometry interface hierarchy and supporting classes. |
org.locationtech.jts.index.chain |
Contains classes that implement Monotone Chains
|
org.locationtech.jts.linearref |
Contains classes and interfaces implementing linear referencing on linear geometries
|
org.locationtech.jts.operation.buffer.validate |
Classes to perform validation of the results of buffer operations.
|
org.locationtech.jts.shape | |
org.locationtech.jts.triangulate |
Classes to compute Delaunay triangulations.
|
org.locationtech.jts.triangulate.quadedge |
Classes to implement a topological subdivision of quadeges, to support creating triangulations
and Voronoi diagrams.
|
Modifier and Type | Method and Description |
---|---|
static void |
DistanceToPoint.computeDistance(LineSegment segment,
Coordinate pt,
PointPairDistance ptDist) |
Modifier and Type | Method and Description |
---|---|
LineSegment |
LineSegment.offset(double offsetDistance)
Computes the
LineSegment that is offset from
the segment by a given distance. |
LineSegment |
LineSegment.project(LineSegment seg)
Project a line segment onto this line segment and return the resulting
line segment.
|
Modifier and Type | Method and Description |
---|---|
Coordinate[] |
LineSegment.closestPoints(LineSegment line)
Computes the closest points on two line segments.
|
double |
LineSegment.distance(LineSegment ls)
Computes the distance between this line segment and another segment.
|
boolean |
LineSegment.equalsTopo(LineSegment other)
Returns
true if other is
topologically equal to this LineSegment (e.g. |
Coordinate |
LineSegment.intersection(LineSegment line)
Computes an intersection point between two line segments, if there is one.
|
Coordinate |
LineSegment.lineIntersection(LineSegment line)
Computes the intersection point of the lines of infinite extent defined
by two line segments (if there is one).
|
int |
LineSegment.orientationIndex(LineSegment seg)
Determines the orientation of a LineSegment relative to this segment.
|
LineSegment |
LineSegment.project(LineSegment seg)
Project a line segment onto this line segment and return the resulting
line segment.
|
void |
LineSegment.setCoordinates(LineSegment ls) |
Constructor and Description |
---|
LineSegment(LineSegment ls) |
Modifier and Type | Method and Description |
---|---|
void |
MonotoneChain.getLineSegment(int index,
LineSegment ls)
Gets the line segment starting at
index |
void |
MonotoneChainOverlapAction.overlap(LineSegment seg1,
LineSegment seg2)
This is a convenience function which can be overridden to obtain the actual
line segments which overlap
|
void |
MonotoneChainSelectAction.select(LineSegment seg)
This is a convenience method which can be overridden to obtain the actual
line segment which is selected.
|
Modifier and Type | Method and Description |
---|---|
LineSegment |
LinearLocation.getSegment(Geometry linearGeom)
Gets a
LineSegment representing the segment of the
given linear Geometry which contains this location. |
Modifier and Type | Method and Description |
---|---|
static void |
DistanceToPointFinder.computeDistance(LineSegment segment,
Coordinate pt,
PointPairDistance ptDist) |
Modifier and Type | Method and Description |
---|---|
LineSegment |
GeometricShapeBuilder.getSquareBaseLine() |
Modifier and Type | Method and Description |
---|---|
LineSegment |
Segment.getLineSegment()
Gets a LineSegment modelling this segment.
|
Constructor and Description |
---|
SplitSegment(LineSegment seg) |
Modifier and Type | Method and Description |
---|---|
LineSegment |
LocateFailureException.getSegment() |
LineSegment |
QuadEdge.toLineSegment()
Creates a
LineSegment representing the
geometry of this edge. |
Modifier and Type | Method and Description |
---|---|
void |
QuadEdgeTriangle.getEdgeSegment(int i,
LineSegment seg) |
Constructor and Description |
---|
LocateFailureException(LineSegment seg) |
LocateFailureException(String msg,
LineSegment seg) |
Copyright © 2022. All rights reserved.