CGAL users discussion list

[Monique Teillaud <>]

Kwok Jasper wrote:

> In the class Vertex_base_for_ssr, it has the member 
> vector<Vertex_handle> neighbor_vertex_handle
>
> I have first insert points into a Triangulation, then
> for eac h vertex in the triangulation, I set its neighbor_vertex_handle 
> to contain the vertex handle of the its neighbor points

Is there a specific reason why you want to store the neighbors in the 
vertex?

The triangulation already stores the information, it seems redundant to 
me to store it twice, unless you have a strong reason to do so.
(also, how are you going to update this information each time it changes 
when you insert new points...?)

You can easily access the information on adjacent vertices stored by the 
triangulation and traverse the neighbors of a vertex:
just use t.incident_vertices() that gives you an outputiterator (see 
reference manual of Triangulation_3)