|void||insert (EdgeEnd *ee)|
|Insert a directed edge in the list. |
|Label &||getLabel ()|
|int||getOutgoingDegree (EdgeRing *er)|
|DirectedEdge *||getRightmostEdge ()|
|void||computeLabelling (std::vector< GeometryGraph * > *geom)|
|Compute the labelling for all dirEdges in this star, as well as the overall labelling. |
|For each dirEdge in the star, merge the label from the sym dirEdge into the label. |
|void||updateLabelling (const Label &nodeLabel)|
|Update incomplete dirEdge labels from the labelling for the node. |
|void||linkMinimalDirectedEdges (EdgeRing *er)|
|Traverse the star of edges, maintaing the current location in the result area at this node (if any). |
|void||computeDepths (DirectedEdge *de)|
|Compute the DirectedEdge depths for a subsequence of the edge array. |
A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node.
It supports labelling the edges as well as linking the edges to form both MaximalEdgeRings and MinimalEdgeRings.
|void geos::geomgraph::DirectedEdgeStar::computeDepths||(||DirectedEdge *||de||)|
Compute the DirectedEdge depths for a subsequence of the edge array.
Traverse the star of edges, maintaing the current location in the result area at this node (if any).
If any L edges are found in the interior of the result, mark them as covered.
Traverse the star of DirectedEdges, linking the included edges together. To link two dirEdges, the <next> pointer for an incoming dirEdge is set to the next outgoing edge.
DirEdges are only linked if:
Edges are linked in CCW order (the order they are stored). This means that rings have their face on the Right (in other words, the topological location of the face is given by the RHS label of the DirectedEdge)
PRECONDITION: No pair of dirEdges are both marked as being in the result
Referenced by geos::geomgraph::PlanarGraph::linkResultDirectedEdges().