Hi Sebastien,
Thanks for your update. I will rerun the benchmarks and update the
documentation for the upcoming Boost release.
It will be also helpful if you provide the code snippet to evaluate
Voronoivertex coordinates based on the
Delaunay triangle.
Last time I was not able to find one in CGAL (4.0) documentation.
Regards,
Andrii
On Wed, Mar 13, 2013 at 7:57 PM, Sebastien Loriot
Hello,
I'm involved in the CGAL Project, and saw the Voronoi benchmark. It would be nice if you could change the CGAL code slightly, as it is not as bad as it currently seems. Attached is the diff to the trunk of boost.
Concerning the Voronoi diagram of points, a CGAL user, would use the Delaunay_triangulation_2 class.
Concerning the Voronoi diagram of segments (that do not intersect) one would make a better choice for number types and traits classes. Also one better first inserts the endpoints and then the segments (I agree, this should definitely go into a member function).
Admittedly our examples could be better.
Cheers,
Sebastien
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost