CGAL users discussion list

[ChaoM <>]

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 !



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/CGAL-4-3-Released-Computational-Geometry-Algorithms-Library-tp4658239p4658367.html
Sent from the cgal-discuss mailing list archive at Nabble.com.