|
Boost : |
Subject: Re: [boost] [polygon] [GSOC] voronoi diagram of line segments
From: Fernando Cacciola (fernando.cacciola_at_[hidden])
Date: 2010-10-26 21:53:23
Hi Luke,
Hi Andrii,
First of all, congratulations to you both on such an achivement!!
I will try to squeeze some free time during the next weeks to sneak peak into
the code and provide some constructive cricticism.
> Thomas Klimpel wrote:
>> I agree with Luke's assessment. Even the popular Qhull code
>> <http://www.qhull.org/> only computes Voronoi diagrams of points. Of
>> course, CGAL implements Voronoi diagrams of line segments
>> <http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Segment_Delaunay_graph_2/Chapter_main.html>,
>> but CGAL is not "free". I didn't see a "free" implementation in
>> <http://www.geom.uiuc.edu/software/cglist/>, but I think
>> <http://www.cosy.sbg.ac.at/~held/projects/vroni/vroni.html> is at
>> least another non-"free" implementation for Voronoi diagrams of line
>> segments.
>
> Thanks for the link to vroni, I didn't know of its existence.
>
Have in mind that Vroni (which indeed is not free) does not use exact predicates
so it is not robust. At least last time I checked (this is many many years ago)
Martin might have have updated it since then though.
Best
-- --- Fernando Cacciola SciSoft Consulting, Founder http://www.scisoft-consulting.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk