CGAL users discussion list

[Olivier Devillers <>]

Le 3/19/14 1:38 PM, Per Zetterlund a écrit :
> Hi All,
>
> I'm sorry if this is a FAQ; I searched the archives
> but didn't find any good answers.
>
> I have a 3D Delaunay triangulation and I want
> the corresponding 3D Voronoi graph. I know
> of draw_dual and its dual() friends but that seems
> not to take into account the connectivity of the
> objects. I want a graph where the Voronoi vertices
> actually are connected so that I can apply graph
> algorithms on it.
From a Delaunay tetrahedron, you can access its "neighbors"
n=c->neighbor(i) (where c is a cell handle)

the dual of c and n are Voronoi vertices that are linked by an edge in 
the Voronoi diagram.