CGAL users discussion list

[Sylvain Pion <>]

Robert Bryce a écrit :
> These should be easy questions.  I need to generate 2-D Delaunay and 
> Voronoi diagrams.
>
> I’ve got a current code set based on that written by Olivie Devillers 
> some 10 years ago.  I used his code because it was fast and would allow 
> me to dynamically add and remove points.  However, I’ve found that this 
> (older) code (about 10 years old) will endless loop on occasion, as well 
> as crash.
>
> My needs have also changed – I need to handle barriers now.  I’m also 
> dealing with so many points (easily 25,000+) that I either need a much 
> faster serial operation or (preferred) a multithreaded solution.  Does 
> the CGAL solution allow me to dynamically add and remove points (it 
> appears so),

It does.

> and possibly even insert barriers (not so sure), while
> keeping handle for each vertex back to my own structures?

If by "barrier" you mean a segment which is a constraint, then yes.
You can have a look at the constrained triangulation and possibly
Mesh_2 packages of CGAL to get a better idea if what CGAL provides
fits your needs.

> Is there any opportunity to multithread the CGAL code?

Currently no, but in some future, most probably.

--
Sylvain Pion
INRIA Sophia-Antipolis
Geometrica Project-Team
CGAL, http://cgal.org/