CGAL users discussion list

Bernhard Kornberger wrote:
>  schrieb:

> > > Is it true that I have to implement the conversion from
> > > the power diagram to a graph of the power diagram by myself
> > > or is there already a function that I didn't find?
> >
> >
> > The graph is dual to the triangulation (up to degeneracies), do you 
> > need to convert the triangulation to its dual that you would store in 
> > addition ?
> >
> >     Monique
>
>
> Right. I need a function like this:
>
> Regular_triangulation Tr;
> Tr.insert(p1);
> Tr.insert(p2);
> Tr.insert(p3);
> Tr.insert(p4);
>
> UndirectedGraph g=Tr.dual();
>
> ..such that I can traverse along the edges of $g afterwards.

but you can traverse edges of g by just following adjacency relations 
between tetrahedra in Tr, without storing g.
        Monique