Package Name | Comment |
com.vividsolutions.jts | |
com.vividsolutions.jts.algorithm |
Contains classes and interfaces implementing fundamental computational geometry algorithms.
Robustness
Geometrical algorithms involve a combination of combinatorial and numerical computation. As with
all numerical computation using finite-precision numbers, the algorithms chosen are susceptible to
problems of robustness. A robustness problem occurs when a numerical calculation produces an
incorrect answer for some inputs due to round-off errors. Robustness problems are especially
serious in geometric computation, since they can result in errors during topology building.
There are many approaches to dealing with the problem of robustness in geometrical computation.
Not surprisingly, most robust algorithms are substantially more complex and less performant than
the non-robust versions. Fortunately, JTS is sensitive to robustness problems in only a few key
functions (such as line intersection and the point-in-polygon test). There are efficient robust
algorithms available for these functions, and these algorithms are implemented in JTS.
Computational Performance
Runtime performance is an important consideration for a production-quality implementation of
geometric algorithms. The most computationally intensive algorithm used in JTS is intersection
detection. JTS methods need to determine both all intersection between the line segments in a
single Geometry (self-intersection) and all intersections between the line segments of two different
Geometries.
The obvious naive algorithm for intersection detection (comparing every segment with every other)
has unacceptably slow performance. There is a large literature of faster algorithms for intersection
detection. Unfortunately, many of them involve substantial code complexity. JTS tries to balance code
simplicity with performance gains. It uses some simple techniques to produce substantial performance
gains for common types of input data.
Package Specification
|
com.vividsolutions.jts.generator | |
com.vividsolutions.jts.geom |
Contains the Geometry interface hierarchy and supporting classes.
The Java Topology Suite (JTS) is a Java API that implements a core set of spatial data operations using an explicit precision model and robust geometric algorithms. JTS is intended to be used in the development of applications that support the validation, cleaning, integration and querying of spatial datasets.
JTS attempts to implement the OpenGIS Simple Features Specification (SFS) as accurately as possible. In some cases the SFS is unclear or omits a specification; in this case JTS attempts to choose a reasonable and consistent alternative. Differences from and elaborations of the SFS are documented in this specification.
Package Specification
|
com.vividsolutions.jts.geom.impl | |
com.vividsolutions.jts.geom.util |
Provides classes that parse and modify Geometry objects.
|
com.vividsolutions.jts.geomgraph |
Contains classes that implement topology graphs.
The Java Topology Suite (JTS) is a Java API that implements a core set of spatial data operations using an explicit precision model and robust geometric algorithms. JTS is intended to be used in the development of applications that support the validation, cleaning, integration and querying of spatial datasets.
JTS attempts to implement the OpenGIS Simple Features Specification (SFS) as accurately as possible. In some cases the SFS is unclear or omits a specification; in this case JTS attempts to choose a reasonable and consistent alternative. Differences from and elaborations of the SFS are documented in this specification.
Package Specification
|
com.vividsolutions.jts.geomgraph.index |
Contains classes that implement indexes for performing noding on geometry graph edges.
|
com.vividsolutions.jts.index |
Provides classes for various kinds of spatial indexes.
|
com.vividsolutions.jts.index.bintree |
Contains classes that implement a Binary Interval Tree index
|
com.vividsolutions.jts.index.chain |
Contains classes that implement Monotone Chains
|
com.vividsolutions.jts.index.quadtree |
Contains classes that implement a Quadtree spatial index
|
com.vividsolutions.jts.index.strtree |
Contains 2-D and 1-D versions of the Sort-Tile-Recursive (STR) tree, a query-only R-tree.
|
com.vividsolutions.jts.index.sweepline |
Contains classes which implement a sweepline algorithm for scanning geometric data structures.
|
com.vividsolutions.jts.io |
Contains the interfaces for converting JTS objects to and from other formats.
The Java Topology Suite (JTS) is a Java API that implements a core set of spatial data operations using an explicit precision model and robust geometric algorithms. JTS is intended to be used in the development of applications that support the validation, cleaning, integration and querying of spatial datasets.
JTS attempts to implement the OpenGIS Simple Features Specification (SFS) as accurately as possible. In some cases the SFS is unclear or omits a specification; in this case JTS attempts to choose a reasonable and consistent alternative. Differences from and elaborations of the SFS are documented in this specification.
Package Specification
|
com.vividsolutions.jts.io.gml2 |
JTS IO: Java Topology Suite IO Library
Classes to read and write the GML2 geometry format.
|
com.vividsolutions.jts.io.oracle |
JTS IO: Java Topology Suite IO Library
Classes to read and write Oracle SDO_GEOMETRY object structures.
|
com.vividsolutions.jts.linearref |
Contains classes and interfaces implementing linear referencing on linear geometries
Linear Referencing
Linear Referencing is a way of defining positions along linear geometries
(LineStrings and MultiLineStrings ).
It is used extensively in linear network systems.
There are numerous possible Linear Referencing Methods which
can be used to define positions along linear geometry.
This package supports two:
- Linear Location - a linear location is a triple
(component index, segment index, segment fraction)
which precisely specifies a point on a linear geometry.
It allows for efficient mapping of the index value to actual coordinate values.
- Length - the natural concept of using the length along
the geometry to specify a position.
Package Specification
|
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.buffer |
Provides classes for computing buffers of geometries
|
com.vividsolutions.jts.operation.distance |
Provides classes for computing the distance between geometries
|
com.vividsolutions.jts.operation.linemerge | |
com.vividsolutions.jts.operation.overlay |
Contains classes that perform a topological overlay to compute boolean spatial functions.
The Overlay Algorithm is used in spatial analysis methods for computing set-theoretic
operations (boolean combinations) of input {@link Geometry}s. The algorithm for
computing the overlay uses the intersection operations supported by topology graphs.
To compute an overlay it is necessary to explicitly compute the resultant graph formed
by the computed intersections.
The algorithm to compute a set-theoretic spatial analysis method has the following steps:
- Build topology graphs of the two input geometries. For each geometry all
self-intersection nodes are computed and added to the graph.
- Compute nodes for all intersections between edges and nodes of the graphs.
- Compute the labeling for the computed nodes by merging the labels from the input graphs.
- Compute new edges between the compute intersection nodes. Label the edges appropriately.
- Build the resultant graph from the new nodes and edges.
- Compute the labeling for isolated components of the graph. Add the
isolated components to the resultant graph.
- Compute the result of the boolean combination by selecting the node and edges
with the appropriate labels. Polygonize areas and sew linear geometries together.
Package Specification
|
com.vividsolutions.jts.operation.overlay.snap | |
com.vividsolutions.jts.operation.overlay.validate | |
com.vividsolutions.jts.operation.polygonize | |
com.vividsolutions.jts.operation.predicate | |
com.vividsolutions.jts.operation.relate |
Contains classes to implement the computation of the spatial relationships of Geometry s.
The relate algorithm computes the IntersectionMatrix describing the
relationship of two Geometry s. The algorithm for computing relate
uses the intersection operations supported by topology graphs. Although the relate
result depends on the resultant graph formed by the computed intersections, there is
no need to explicitly compute the entire graph.
It is sufficient to compute the local structure of the graph
at each intersection node.
The algorithm to compute relate has the following steps:
- Build topology graphs of the two input geometries. For each geometry
all self-intersection nodes are computed and added to the graph.
- Compute nodes for all intersections between edges and nodes of the graphs.
- Compute the labeling for the computed nodes by merging the labels from the input graphs.
- Compute the labeling for isolated components of the graph (see below)
- Compute the
IntersectionMatrix from the labels on the nodes and edges.
Labeling isolated components
Isolated components are components (edges or nodes) of an input Geometry which
do not contain any intersections with the other input Geometry . The
topological relationship of these components to the other input Geometry
must be computed in order to determine the complete labeling of the component. This can
be done by testing whether the component lies in the interior or exterior of the other
Geometry . If the other Geometry is 1-dimensional, the isolated
component must lie in the exterior (since otherwise it would have an intersection with an
edge of the Geometry ). If the other Geometry is 2-dimensional,
a Point-In-Polygon test can be used to determine whether the isolated component is in the
interior or exterior.
Package Specification
|
com.vividsolutions.jts.operation.valid |
Provides classes for testing the validity of geometries.
|
com.vividsolutions.jts.planargraph |
Contains classes to implement a planar graph data structure.
|
com.vividsolutions.jts.planargraph.algorithm | |
com.vividsolutions.jts.precision |
Provides classes for manipulating the precision model of Geometries
|
com.vividsolutions.jts.simplify | |
com.vividsolutions.jts.util |
Contains support classes for the Java Topology Suite.
|
com.vividsolutions.jtsexample.geom | |
com.vividsolutions.jtsexample.linearref | |
com.vividsolutions.jtsexample.operation.distance | |
com.vividsolutions.jtsexample.operation.linemerge | |
com.vividsolutions.jtsexample.operation.polygonize | |
com.vividsolutions.jtsexample.precision | |
com.vividsolutions.jtsexample.technique | |