CGAL users discussion list

[Andreas Fabri <>]

 wrote:
> Hello,
>
> I was wondering if it's possible to compute the dual of a Delaunay Edge in 
> 3d. I've looked through the documentation but couldn't find anything. If this 
> is not possible, how should I solve the problem?
>
> Thanks
>
> Angelo

Hi Angelo,

The triangulation

http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Triangulation_3_ref/Class_Triangulation_3.html#Cross_link_anchor_963

offers a Cell_circulator

For a given Edge, it allows to traverse the circular sequence of cells 
adjacent to the edge.
Traverse this sequence and call the "dual" method for the cells which gives 
you
the sequence of  Voronoi vertices describing the polygon.

Note that you must deal with the case of infinite cells, that is where the 
polygon
is not closed.

andreas