private void convertMaximalToMinimalEdgeRings(List ringEdges){
  for (Iterator i=ringEdges.iterator(); i.hasNext(); ) {
    PolygonizeDirectedEdge de=(PolygonizeDirectedEdge)i.next();
    long label=de.getLabel();
    List intNodes=findIntersectionNodes(de,label);
    if (intNodes == null)     continue;
    for (Iterator iNode=intNodes.iterator(); iNode.hasNext(); ) {
      Node node=(Node)iNode.next();
      computeNextCCWEdges(node,label);
    }
  }
}

private void convertMaximalToMinimalEdgeRings ( List ringEdges ) { for ( Iterator i = ringEdges . iterator ( ) ; i . hasNext ( ) ; ) { PolygonizeDirectedEdge de = ( PolygonizeDirectedEdge ) i . next ( ) ; long label = de . getLabel ( ) ; List intNodes = findIntersectionNodes ( de , label ) ; if ( intNodes == null ) continue ; for ( Iterator iNode = intNodes . iterator ( ) ; iNode . hasNext ( ) ; ) { Node node = ( Node ) iNode . next ( ) ; computeNextCCWEdges ( node , label ) ; } } }
convert the maximal edge rings found by the initial graph traversal into the minimal edge rings required by jts polygon topology rules .
