CGAL users discussion list

[Stefan Witzel <>]

Hello,

I do not have any previous experience with cgal and my question is a
rather conceptual one without much technical insight: I would like to
iterate over the faces of a Voronoi diagram and then over the edges of
each face (to obtain a closed polygon); in other words this means to
iterate over the vertices of a Delaunay triangulation and then over
the edges incident with this vertex. Am I right to assume that this is
fundamentally problematic with the default parameters for
Delaunay_triangulation_2 (Triangulation_vertex_base_2,
Triangulation_face_base_2) as a vertex does not ``know'' the edges it
is incident with? Is there a kind of dual assignment that I could use
(like ``(Tessellation_face_base, Tessellation_vertex_base)'')?

Since tessellations into non-triangles may be more complicated, would
it be a possibility to first produce the (common) barycentric
subdivision?

Best,
Stefan