Package | Description |
---|---|
org.locationtech.jts.algorithm |
Contains classes and interfaces implementing fundamental computational geometry algorithms.
|
org.locationtech.jts.algorithm.locate |
Classes to determine the topological location of points in geometries.
|
org.locationtech.jts.geom |
Contains the
Geometry interface hierarchy and supporting classes. |
org.locationtech.jts.geomgraph |
Contains classes that implement topology graphs.
|
org.locationtech.jts.geomgraph.index |
Contains classes that implement indexes for performing noding on geometry graph edges.
|
org.locationtech.jts.noding |
Classes to compute nodings for arrangements of line segments and line segment sequences.
|
org.locationtech.jts.noding.snapround |
Contains classes to implement the Snap Rounding algorithm for noding linestrings.
|
org.locationtech.jts.operation |
Provides classes for implementing operations on geometries
|
org.locationtech.jts.operation.buffer |
Provides classes for computing buffers of geometries
|
org.locationtech.jts.operation.distance |
Provides classes for computing the distance between geometries
|
org.locationtech.jts.operation.overlay |
Contains classes that perform a topological overlay to compute boolean spatial functions.
|
org.locationtech.jts.operation.overlay.validate |
Classes to validate the results of overlay operations.
|
org.locationtech.jts.operation.predicate |
Classes which implement topological predicates optimized for particular kinds of geometries.
|
org.locationtech.jts.operation.relate |
Contains classes to implement the computation of the spatial relationships of
Geometry s. |
org.locationtech.jts.operation.valid |
Provides classes for testing the validity of geometries.
|
org.locationtech.jts.simplify |
Classes which implement algorithms for simplifying or generalizing geometries.
|
org.locationtech.jts.triangulate.quadedge |
Classes to implement a topological subdivision of quadeges, to support creating triangulations
and Voronoi diagrams.
|
Class and Description |
---|
BoundaryNodeRule
An interface for rules which determine whether node points
which are in boundaries of
Lineal geometry components
are in the boundary of the parent geometry collection. |
HCoordinate
Represents a homogeneous coordinate in a 2-D coordinate space.
|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
NotRepresentableException
Indicates that a
HCoordinate has been computed which is
not representable on the Cartesian plane. |
Class and Description |
---|
RayCrossingCounter
Counts the number of segments crossed by a horizontal ray extending to the right
from a given point, in an incremental fashion.
|
Class and Description |
---|
HCoordinate
Represents a homogeneous coordinate in a 2-D coordinate space.
|
Class and Description |
---|
BoundaryNodeRule
An interface for rules which determine whether node points
which are in boundaries of
Lineal geometry components
are in the boundary of the parent geometry collection. |
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
PointLocator |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
BoundaryNodeRule
An interface for rules which determine whether node points
which are in boundaries of
Lineal geometry components
are in the boundary of the parent geometry collection. |
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
PointLocator |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
PointLocator |
Class and Description |
---|
PointLocator |
Class and Description |
---|
RectangleLineIntersector
Computes whether a rectangle intersects line segments.
|
Class and Description |
---|
BoundaryNodeRule
An interface for rules which determine whether node points
which are in boundaries of
Lineal geometry components
are in the boundary of the parent geometry collection. |
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
PointLocator |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
HCoordinate
Represents a homogeneous coordinate in a 2-D coordinate space.
|