/* static private */
void
PolygonizeGraph::findLabeledEdgeRings(std::vector<DirectedEdge*> &dirEdges,
std::vector<PolygonizeDirectedEdge*> &edgeRingStarts)
{
typedef std::vector<DirectedEdge*> Edges;
Edges edges;
// label the edge rings formed
long currLabel=1;
for(Edges::size_type i=0, n=dirEdges.size(); i<n; ++i)
{
#ifdef GEOS_CAST_PARANOIA
assert(dynamic_cast<PolygonizeDirectedEdge*>(dirEdges[i]));
#endif
PolygonizeDirectedEdge *de =
static_cast<PolygonizeDirectedEdge*>(dirEdges[i]);
if (de->isMarked()) continue;
if (de->getLabel() >= 0) continue;
edgeRingStarts.push_back(de);
findDirEdgesInRing(de, edges);
label(edges, currLabel);
edges.clear();
++currLabel;
}
}
/**
*
* @param dirEdges a List of the DirectedEdges in the graph
* @return a List of DirectedEdges, one for each edge ring found
*/
vector<PolygonizeDirectedEdge*>*
PolygonizeGraph::findLabeledEdgeRings(vector<planarDirectedEdge*> *dirEdges)
{
vector<PolygonizeDirectedEdge*> *edgeRingStarts=new vector<PolygonizeDirectedEdge*>();
// label the edge rings formed
long currLabel=1;
for(int i=0;i<(int)dirEdges->size();i++) {
PolygonizeDirectedEdge *de=(PolygonizeDirectedEdge*)(*dirEdges)[i];
if (de->isMarked()) continue;
if (de->getLabel() >= 0) continue;
edgeRingStarts->push_back(de);
vector<planarDirectedEdge*> *edges=findDirEdgesInRing(de);
label(edges, currLabel);
delete edges;
currLabel++;
}
return edgeRingStarts;
}
