All Packages
Package Summary
Package
Description
Contains classes and interfaces implementing fundamental computational geometry algorithms.
Provides classes that implement various kinds of geometric constructions.
Classes to compute distance metrics between geometries.
Classes to determine the topological location of points in geometries.
Classes to compute matching metrics between geometries.
Classes to perform conversions from Java2D shape objects.
Classes to perform densification on geometries.
Contains the
Geometry interface hierarchy and supporting classes.Implementations of interfaces for geometric structures.
Classes to perform optimized geometric operations on suitably prepared geometries.
Provides classes that parse and modify Geometry objects.
Contains classes that implement topology graphs.
Contains classes that implement indexes for performing noding on geometry graph edges.
Provides classes for various kinds of spatial indexes.
Contains classes that implement a Binary Interval Tree index
Contains classes that implement Monotone Chains
Contains classes to implement an R-tree index for one-dimensional intervals.
Contains classes which implement a k-D tree index over 2-D point data.
Contains classes that implement a Quadtree spatial index
Contains 2-D and 1-D versions of the Sort-Tile-Recursive (STR) tree, a query-only R-tree.
Contains classes which implement a sweepline algorithm for scanning geometric data structures.
Contains the interfaces for converting JTS objects to and from other formats.
Classes to read and write the GML2 geometry format.
Contains classes and interfaces implementing linear referencing on linear geometries
Classes to compute nodings for arrangements of line segments and line segment sequences.
Contains classes to implement the Snap Rounding algorithm for noding linestrings.
Provides classes for implementing operations on geometries
Provides classes for computing buffers of geometries
Classes to perform validation of the results of buffer operations.
Provides classes for computing the distance between geometries
Classes to perform line merging.
Contains classes that perform a topological overlay to compute boolean spatial functions.
Classes to perform snapping on geometries to prepare them for overlay operations.
Classes to validate the results of overlay operations.
Contains classes that perform vector overlay
to compute boolean set-theoretic spatial functions.
An API for polygonizing sets of lines.
Classes which implement topological predicates optimized for particular kinds of geometries.
Contains classes to implement the computation of the spatial relationships of
Geometrys.Classes to perform efficient unioning of collections of geometries.
Provides classes for testing the validity of geometries.
Contains classes to implement a planar graph data structure.
Classes which implement graph algorithms on planar graphs.
Provides classes for analyzing and
manipulating the precision of Geometries.
Classes which implement algorithms for simplifying or generalizing geometries.
Classes to compute Delaunay triangulations.
Classes to implement a topological subdivision of quadeges, to support creating triangulations
and Voronoi diagrams.
Contains support classes for the Java Topology Suite.