CGAL users discussion list

[Sylvain Pion <>]

Nizar Khalifa Sallem wrote:
> Hi,
> I was searching in the documentation and mailing list if Vertex_handle 
> from polyhedron and Vertex_handle from triangulation were comparable I 
> mean can I do this :
> ======================================================
> //assume declarations and includes done
> Delaunay3::Vertex_handle dv;
> Polyhedron P;
> //assume creation done
>  for ( Vertex_iterator v = P.vertices_begin(); v != P.vertices_end(); ++v){
>    if (v == vd) {
>     //do something
>    }
> }
> but didn't found any entry, can someone help?
> =======================================================

No, they are not comparable.
Delaunay and Polyhedron are totally different data structures in memory,
so why would you want to do this anyway ?

> By the way are circulators and iterator around vertices comparable or not?

Within the same data structure, I believe these should be, yes.
At least they should both be convertible to the common corresponding
handle types.  There could be some issues in particular cases though.

--
Sylvain Pion
INRIA Sophia-Antipolis
Geometrica Project-Team
CGAL, http://cgal.org/