CGAL users discussion list

[Stefan Witzel <>]

Hi,

Sorry about my last question! In case someone is actually wondering:
the answer are face circulators [1]. The documentation would be much
more accessible if one could see all the inherited methods somewhere.
I was looking at the documentation for
Hyperbolic_Delaunay_triangulation_2 and from there it's a bit of a way
down to Triangulation_2, especially when you are wondering about the
traits and data structures along the way.

Best,
Stefan

[1] 
https://doc.cgal.org/latest/Triangulation_2/classCGAL_1_1Triangulation__2.html#a1bda2ab92ccf638bb22fc223ae281b96

Am Do., 13. Juni 2019 um 16:32 Uhr schrieb 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