See: Description
| Class | Description |
|---|---|
| ConsistentPolygonRingChecker |
Tests whether the polygon rings in a
GeometryGraph
are consistent. |
| EdgeSetNoder |
Nodes a set of edges.
|
| LineBuilder |
Forms JTS LineStrings out of a the graph of
DirectedEdges
created by an OverlayOp. |
| MaximalEdgeRing |
A ring of
DirectedEdges which may contain nodes of degree > 2. |
| MinimalEdgeRing |
A ring of
Edges with the property that no node
has degree greater than 2. |
| OverlayNodeFactory |
Creates nodes for use in the
PlanarGraphs constructed during
overlay operations. |
| OverlayOp |
Computes the geometric overlay of two
Geometrys. |
| PointBuilder |
Constructs
Points from the nodes of an overlay graph. |
| PolygonBuilder |
Forms
Polygons out of a graph of DirectedEdges. |
The Overlay Algorithm is used in spatial analysis methods for computing set-theoretic
operations (boolean combinations) of input Geometrys. 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:
Copyright © 2024. All rights reserved.