CGAL users discussion list

[Benjamin Bouscasse <>]

2010/3/26 Laurent Rineau (GeometryFactory) <>

>
> Here is the a piece of code:
> Declaration are the ones of the mesh_global.cpp example.
>
>   std::map<Vertex_handle,int> vertex_index;
>   int idx = 0;
>   int nn=cdt.number_of_vertices();
>   std::vector<Vertex_handle> TV(nn);
>   int ii=0;
>   for(CDT::Vertex_iterator vit=cdt.vertices_begin(); vit !=
> cdt.vertices_end(); ++vit)
>    {
>          vertex_index[vit]=idx++;
>               TV[ii++]=vit;
>    }

Here you give an index to all vertices of the triangulation (including the
infinite one).

TV[0] is cdt.vertices_begin(). There is no reason that vertex is the infinite
one (you are iterating of finite vertices: vertex_begin() is a deprecated name
for finite_vertices_begin()). Then, it is normal that a finite face can be

incident to that vertex numbered 0.

Thank you for the fast response, For the is_in_domain() is exactly what I need.

For the first one, in my code there is also:
   assert(TV[0]==cdt.infinite_vertex());
And when I plot the triangulation all triangles are ok, so I don't understand how it can be a kind of shift in the vertex indexes. 

I would try to correct anyway taken into account your info.

Thanks, 
Benjamin