CGAL users discussion list

[Martin Baeker <>]

Dear experts,

I am currently updating my code from version 3.1 to 3.3.1.

In between, the Arrangement_2-class has changed drastically and I am
missing the old possibility of iterating over the curves of an
Arrangement:

Old code (taken almost directly from the 3.1 manual)

Arr_2 pm;
// Trial: Insert the segments one by one
pm.insert(seglist.begin(), seglist.end());
for (unsigned int i=0; i< seglist.size(); i++)
     pm.insert_curve(seglist[i]);
std::cout << "\n\nWriting pm's halfedges" << std::endl;
Arr_2::Edge_iterator eit;
Arr_2::Curve_iterator cit;
unsigned int edgeCounter=0;
for (cit = pm.curve_node_begin(); cit != pm.curve_node_end(); ++cit) 
  {
     std::cout << std::endl << "Curve level:" << std::endl << cit->curve()
               << std::endl ;
     std::cout << "Edge level:" << std::endl;
    edgeCounter++;
     for (eit = cit->edges_begin(); eit != cit->edges_end(); ++eit) 
     {
       std::cout << eit->x_curve() << std::endl ;
     }
  }

However, this does not work anymore because there is no
Arr_2::Curve_iterator class anymore. I searched through the Docs but
could not find how this can be replaced with another iterator.
Is it still possible to traverse the Curves of an Arrangement?

Thanks a lot in advance,

Martin.
 

                   Priv.-Doz. Dr. Martin Bäker
                   Institut für Werkstoffe
                   Technische Universität Braunschweig
                   Langer Kamp 8
                   38106 Braunschweig
                   Germany
                   Tel.: 00-49-531-391-3073
                   Fax   00-49-531-391-3058
                   e-mail 
<>