CGAL users discussion list

[Laurent Rineau <>]

On Wednesday 01 August 2007 10:29:06 

 wrote:
> I agree that you need to store the graph as some graph data structure of
> the BGL if you want to use directly some existing BGL algorithms. This
> is maybe what you mean.

Actually, to use the BGL you do not need to duplicate the graph stored in the 
Delaunay triangulation. You only need to create a sort of traits class, that 
maps the API of the Delaunay triangulation to the API need by BGL algorithms.

Bernhard, as said Monique, all the combinatorial information of the Voronoi 
diagram is already in the Delaunay triangulation. If you also need the 
geometric information of the Voronoi diagram, you can generate it on-the-fly 
during your traversal.

-- 
Laurent Rineau
INRIA - Sophia Antipolis
BP 93, 2004 Route des Lucioles
06902 Sophia Antipolis Cedex FRANCE
Tel: +33 4 92 38 78 62