CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Compute all dual vertices at once by iterating over cells
(use a std map for the association or use
Triangulation_cell_base_with_info_3 [1] to store an index in a
vector, ...).
Then iterate over all edges and turn around the edge ( 
t.incident_cells(Edge e) ) and get each vertex of the polygon.

Note that in case of infinite cells, you'll have rays to consider.

I advise you to read:
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_3_ref/Class_Delaunay_triangulation_3.html#Index_anchor_1689

Note that if you need to build a more complicated data structure,
the demo of the package Linear cell complex can build the Voronoi
diagram of a set of points.

Sebastien.

[1] 
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_3_ref/Class_Triangulation_cell_base_with_info_3.html

On 07/23/2013 04:20 PM, Julian Johnson wrote:
> I need to draw polygonal voronoi cells in 3D and am looking for an
> efficient mechanism for identifying the facets of those individual
> cells. The end result would be a list consisting of the position of each
> voronoi centre vertex and the associated half planes that 'enclose' it
> or a proper polygonal description describing each of the 'enclosing'
> polygons and their vertices. Is there a way to do this in CGAL?
>
> Julian