CGAL users discussion list

[disruptive <>]

I wish to iterate over a Delauney triangulation by vertex and for each
vertex. 

I wish to determine the faces that share this vertex. And then for each
face, I wish to determine the vertices's that comprise this face (one of
which will be the shared the vertex). The latter part can be done.

However my question relates to how best to get nearest neighbour vertices,
is there a way with the edge function? 

Some suggestions for the least complex way to do this would be very much
appreciated.

Thanks
-- 
View this message in context: 
http://www.nabble.com/Nearest-neighbour-vertices-tp22786442p22786442.html
Sent from the cgal-discuss mailing list archive at Nabble.com.