CGAL users discussion list

["Laurent Rineau (CGAL/GeometryFactory)" <>]

Le lundi 04 novembre 2013 05:43:23 ChaoM a écrit :
> Hi Laurent:
>      Thank you for reminding us to update the verson of CGAL. I am confused
> such a problem: I use the Nef Polyhedron to solve the 3D Bool Operation
> between different polyhedrons(eg: shere,clinder,cube). All these polyhedrons
> are made of triangles. But I find that the computing time is very large
> (about 1000 triangles cost 5mins). I wanta to know whether there exits a
> solution to improve efficiency of 3D boolean operation, or in the new
> verson CGAL(like CGAL 4.3),there is a better way than the Nef polyhedron?
> Thank you very much !

Have you compiled the code with optimization and the flag -DNDEBUG? Unless 
your 
data are degenerated, the cost you report seems unusual.

-- 
Laurent Rineau, PhD
R&D Engineer at GeometryFactory           http://www.geometryfactory.com/
Release Manager of the CGAL Project       http://www.cgal.org/