CGAL users discussion list

[Julian Johnson <>]

On 23/07/2013 18:28, Sebastien Loriot (GeometryFactory) wrote:
> 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.
Thanks Sebastien. Perfect.