| Package | Description |
|---|---|
| com.vividsolutions.jts.algorithm |
Contains classes and interfaces implementing fundamental computational geometry algorithms.
|
| com.vividsolutions.jts.geom |
Contains the
Geometry interface hierarchy and supporting classes.
|
| com.vividsolutions.jts.geomgraph |
Contains classes that implement topology graphs.
|
| com.vividsolutions.jts.geomgraph.index |
Contains classes that implement indexes for performing noding on geometry graph edges.
|
| com.vividsolutions.jts.noding |
Classes to compute nodings for arrangements of line segments and line segment sequences.
|
| com.vividsolutions.jts.noding.snapround |
Contains classes to implement the Snap Rounding algorithm for noding linestrings.
|
| com.vividsolutions.jts.operation |
Provides classes for implementing operations on geometries
|
| com.vividsolutions.jts.operation.overlay |
Contains classes that perform a topological overlay to compute boolean spatial functions.
|
| com.vividsolutions.jts.operation.relate |
Contains classes to implement the computation of the spatial relationships of
Geometrys.
|
| 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.
|
| CGAlgorithms
Specifies and implements various fundamental Computational Geometric algorithms.
|
| 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.
|
| PointInRing
An interface for classes which test whether a
Coordinate lies inside a ring.
|
| 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 |
|---|
| 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.
|
| 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.
|