Package org.locationtech.jts.coverage

Classes that operate on polygonal coverages.

A polygonal coverage is a set of polygonal geometries which is non-overlapping and edge-matched. (Polygons or MultiPolygons). A set of polygonal geometries is a valid coverage if:

1. Each geometry is valid
2. The interiors of all polygons are disjoint (they are non-overlapping). This is the case if no polygon has a boundary which intersects the interior of another polygon.
3. Where polygons are adjacent (i.e. their boundaries intersect), they are edge-matched: the vertices (and thus line segments) of the common boundary section match exactly.

A coverage may contain holes and disjoint regions.

Coverage algorithms (such as CoverageUnion) generally require the input coverage to be valid to produce correct results. Coverages can be validated using CoverageValidator.

Class Summary

Class	Description
CoverageGapFinder	Finds gaps in a polygonal coverage.
CoveragePolygonValidator	Validates that a polygon forms a valid polygonal coverage with the set of polygons adjacent to it.
CoverageSimplifier	Simplifies the boundaries of the polygons in a polygonal coverage while preserving the original coverage topology.
CoverageUnion	Unions a polygonal coverage in an efficient way.
CoverageValidator	Validates a polygonal coverage, and returns the locations of invalid polygon boundary segments if found.