CGAL users discussion list

[randooom <>]

Hi all,

I have to do some computation on a Voronoi diagram and therefore I need to
extract the diagram out of the triangulation into a more accessible data
structure.

A colleague has done this some time ago, but his version is incredible slow
(it takes 4 hours! to extract a Voronoi diagram from a triangulation of only
5000 points).

The said data structure consists basically of vertices, faces and cells. The
vertices represent the points and know their adjacent vertices, a face knows
its vertices and a cell its faces.

If possible I'd like to keep this structure, because some other code depends
on it.
However, the main goal is to make the extraction of the Voronoi diagram
faster.

I would appreciate any ideas or pointers (not the C ones ;)).

Thanks,
Daniel
-- 
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Extracting-Voronoi-diagram-from-Regular-triangulation-3-tp3068218p3068218.html
Sent from the cgal-discuss mailing list archive at Nabble.com.