CGAL users discussion list

[Andreas Fabri <>]

Hi Lionel,

The look looks ok. What might be a problem is the remove_constrained_edge 
during the loop.
It's a little bit like erasing an iterator in a list, and then do a ++ on it.
Does your loop also not work, when you just do a complete tour without 
modifying the
triangulation.

What is vch.m_ptr.p->_p.base.base.elems
Do you get the same output, when you  write std::cout << vch->point();


regards,

andreas

Lionel wrote:
> Hello,
>
> I am trying to use a vertex_circulator in a constraint delaunay triangulation.
> An I obtain an infinite loop and I do not understand why...
>
> I would like to turn around the Vertex_handle vh (to find the vertices that 
> are
> the second vertex of the  edges starting at vh).
> I thought that it was a simple loop like this :
>
> CDT::Vertex_circulator vc = m_cdt.incident_vertices(vh), done(vc);
> do 
> {
>         assert(m_cdt.is_valid());// to debug
>         Vertex_handle vch(vc);  // to debug
>         
>         [...]                   // my code to remove_constrained_edge when
> needed
>
> } while (++vc != done);
>
> Maybe I did not understand what is a vertex circulator ?
> Or is there an error in this code ?
>
> I thought that the Vertex_circulator vc and the Vertex_handle vch built with 
> vc
> are the same vertex. But in the debugger I have different coordinates... :
> vch.m_ptr.p->_p.base.base.elems 0x0884f868
> [0]     3.5743930654296299      double
> [1]     0.57512286625400599     double
> vc._v.m_ptr.p->_p.base.base.elems 0x0885cfd8
> [0]     3.2727272017928222      double
> [1]     1.6818181818181819      double
> Did I miss something... ?
>
> Thanks for your help,
> Lionel