public List deleteCutEdges(){
  computeNextCWEdges();
  findLabeledEdgeRings(dirEdges);
  List cutLines=new ArrayList();
  for (Iterator i=dirEdges.iterator(); i.hasNext(); ) {
    PolygonizeDirectedEdge de=(PolygonizeDirectedEdge)i.next();
    if (de.isMarked())     continue;
    PolygonizeDirectedEdge sym=(PolygonizeDirectedEdge)de.getSym();
    if (de.getLabel() == sym.getLabel()) {
      de.setMarked(true);
      sym.setMarked(true);
      PolygonizeEdge e=(PolygonizeEdge)de.getEdge();
      cutLines.add(e.getLine());
    }
  }
  return cutLines;
}

public List deleteCutEdges ( ) { computeNextCWEdges ( ) ; findLabeledEdgeRings ( dirEdges ) ; List cutLines = new ArrayList ( ) ; for ( Iterator i = dirEdges . iterator ( ) ; i . hasNext ( ) ; ) { PolygonizeDirectedEdge de = ( PolygonizeDirectedEdge ) i . next ( ) ; if ( de . isMarked ( ) ) continue ; PolygonizeDirectedEdge sym = ( PolygonizeDirectedEdge ) de . getSym ( ) ; if ( de . getLabel ( ) == sym . getLabel ( ) ) { de . setMarked ( true ) ; sym . setMarked ( true ) ; PolygonizeEdge e = ( PolygonizeEdge ) de . getEdge ( ) ; cutLines . add ( e . getLine ( ) ) ; } } return cutLines ; }
finds and removes all cut edges from the graph .
