CGAL users discussion list

[Monique Teillaud <>]

Hi

look at
http://doc.cgal.org/latest/Triangulation_2/classCGAL_1_1Triangulation__2.html

Vertex_circulator       incident_vertices (Vertex_handle v) const
 Vertex_circulator      incident_vertices (Vertex_handle v, Face_handle f)

Best,
--
Monique Teillaud
http://www.inria.fr/sophia/members/Monique.Teillaud/
INRIA Sophia Antipolis - Méditerranée
Institut National de Recherche en Informatique et Automatique

Le 27/10/14 17:50, Jack Stalnaker a écrit :
> Is there a simple way to step through and/or count all the vertices in a
> triangulation that are connected to a specified vertex? I don't see
> anything in the manual.
>
> Thanks.