CGAL users discussion list

[Laurent Rineau <>]

On Wednesday 10 October 2007 11:53:50 Matthijs Sypkens Smit wrote:
> Using a CGAL Nef polyhdron to do inside/outside tests on a polyhedron is
> relatively inefficient in my experience. From the limited tests that I did
> with some triangulated models it was in the order of 10000 times slower
> than using a (constrained) Delaunay triangulation. Another very fast
> method is the use of a binary space partition of your triangulated models.
> Both methods (Delaunay and BSP) have the drawback that the initial data
> structure is hard to create.

Mister Sypkens Smit, do you have an implementation of such a data structure, 
that is usable for that task?

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