A connected subset of the graph of DirectedEdges and Nodes. Its edges will generate either
- a single polygon in the complete buffer, with zero or more holes, or
- one or more connected holes
BufferSubgraphs are compared on the x-value of their rightmost Coordinate. This defines a partial ordering on the graphs such that:
g1 >= g2 <==> Ring(g2) does not contain Ring(g1)
where Polygon(g) is the buffer polygon that is built from g.
This relationship is used to sort the BufferSubgraphs so that shells are guaranteed to be built before holes.
Creates the subgraph consisting of all edges reachable from this node. Finds the edges in the graph and the rightmost coordinate.
||a node to start the graph traversal from.|
Find all edges whose depths indicates that they are in the result area(s). Since we want polygon shells to be oriented CW, choose dirEdges with the interior of the result on the RHS. Mark them as being in the result. Interior Area edges are the result of dimensional collapses. They do not form part of the result area boundary.
Computes the envelope of the edges in the subgraph. The envelope is cached after being computed.
the envelope of the graph.
Gets the rightmost coordinate in the edges of the subgraph