JTS Feature Summary

A description of the features and functions provided by JTS, with links to the Javadoc.

1. Geometry Model
2. Precision Handling
3. Validation and Repair
4. Geometry I/O
5. Geometry Operations
6. Metric Functions
7. Spatial Predicates
   1. Topological Predicates
   2. Distance predicates
8. Overlay
9. Geometric Constructions
10. Spatial algorithms
11. Spatial structures
    1. Spatial index structures:
    2. Graph structures and algorithms
12. Mathematical Functions
13. High-Precision Arithmetic

Geometry Model

Support for all geometry types defined in the OGC Simple Features for SQL specification, including:

• Geometry (abstract base class)
• Point
• LineString
• Polygon
• MultiPoint
• MultiLineString
• MultiPolygon
• GeometryCollection

Precision Handling

• Explicit coordinate Precision Model
• Geometry precision reduction

Validation and Repair

• Topological validity checking
• Geometry fixing

Geometry I/O

• WKT (Well-Known Text) reader and writer
• WKB (Well-Known Binary) reader and writer
• GML(Geography Markup Language) Version 2 reader and writer
• Java Swing/AWT Shape writer

Geometry Operations

• Area
• Length/Perimeter
• Distance between geometries and

Metric Functions

• Euclidean Distance between geometries, with nearest points
• Discrete Hausdorff distance, with nearest points
• Discrete Frechet distance, with nearest points
• Area and Hausdorff similarity measures

Spatial Predicates

Topological Predicates

• Spatial Predicates based on the Egenhofer DE-9IM model, including the named predicates:
  • contains, within
  • covers, coveredBy
  • intersects, disjoint
  • crosses
  • overlaps
  • touches
  • equals and the general relate predicate returning the DE-9IM intersection matrix

Distance predicates

isWithinDistance predicate

Overlay

Overlay functions including

• intersection
• difference
• symmetric difference
• union
• unary union, providing fast union of geometry collections

Geometric Constructions

• Buffer computation (also known as Minkowski sum with a circle)
  • selection of buffer end-cap and join styles.
• Convex hull
• Geometric simplification including the Douglas-Peucker algorithm and topology-preserving simplification
• Geometric densification
• Linear referencing
• Delaunay triangulation and Conforming Delaunay triangulation
• Voronoi diagram generation
• Minimum Diameter of a geometry
• Minimum Enclosing Rectangle
• Minimum Bounding Circle

Spatial algorithms

• Robust line segment intersection
• Efficient line arrangement intersection and noding
• Snap-rounding for noding line arrangements
• Efficient Point-in-Polygon testing

Spatial structures

Spatial index structures:

• Quadtree
• STR-tree
• KD-tree
• Interval R-tree
• Monotone Chains

Graph structures and algorithms

• Planar graphs and graph algorithms

Mathematical Functions

• Angle computations
• Vector arithmetic

High-Precision Arithmetic

• Robust evaluation of 2x2 double-precision determinants
• DoubleDouble extended-precision arithmetic