A collection of
Computes the topological relationship between two Geometries.
Represents a node in the topological graph used to compute spatial relationships.
Implements the simple graph of Nodes and EdgeEnd which is all that is required to determine topological relationships between Geometries.
Implements the SFS relate() generalized spatial predicate on two
relate algorithm computes the
IntersectionMatrix describing the
relationship of two
Geometrys. The algorithm for computing
uses the intersection operations supported by topology graphs. Although the
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:
IntersectionMatrixfrom the labels on the nodes and edges.
Geometrywhich do not contain any intersections with the other input
Geometry. The topological relationship of these components to the other input
Geometrymust 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
Geometryis 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
Geometryis 2-dimensional, a Point-In-Polygon test can be used to determine whether the isolated component is in the interior or exterior.
Copyright © 2020. All rights reserved.