CGAL users discussion list

[Andreas Fabri <>]

thetis guan wrote:
> Hello,
>
> I'm a newbie with CGAL and programming overall. I've been trying to 
> build 2Ddelaunay triangulation.
>
> Now i want to access all nearest vertices of a vertex of delaunay, but i 
> can not find any  functions to get.
> What to do?


I don't know if with nearest you mean incident or geometrically nearest.
For the former look for Vertex_circulator in the page

http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Triangulation_2_ref/Class_Triangulation_2.html