CGAL users discussion list

[Olivier Devillers <>]

400555 a écrit :
> Hello.
> Let us suppose that we have Delaunay 2D triangulation.
> How to get edge from it if I know 2 vertices ?
> And how to check if there is an edge in triangulation between these 
> two vertices?
>
> Thank you.

looking at the manual is often useful !

http://www.cgal.org/Manual/3.4/doc_html/cgal_manual/Triangulation_2_ref/Class_Triangulation_2.html#Cross_link_anchor_1166

bool     t.is_edge ( Vertex_handle va, Vertex_handle vb)
       true if there is an edge having va and vb as vertices.