| Package | Description |
|---|---|
| org.locationtech.jts.algorithm |
Contains classes and interfaces implementing fundamental computational geometry algorithms.
|
| 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.operation |
Provides classes for implementing operations on geometries
|
| org.locationtech.jts.operation.overlay |
Contains classes that perform a topological overlay to compute boolean spatial functions.
|
| org.locationtech.jts.operation.relate |
Contains classes to implement the computation of the spatial relationships of
Geometrys. |
| org.locationtech.jts.operation.relateng |
Provides classes to implement the RelateNG algorithm
computes topological relationships of
Geometrys. |
| org.locationtech.jts.operation.valid |
Classes for testing the validity and simplicity of geometries,
as defined in the OGC Simple Features specification.
|
| 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 |
|---|
| 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. |
| 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. |
| 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 |
|---|
| 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. |
| 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. |
| 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. |
Copyright © 2024. All rights reserved.