CGAL users discussion list

[ChaoM <>]

Hello Laurent:
      Thank you for your good advice.  In my past research , I do use the
AABB Tree to sovle the Boolean Operation (For example : two half sphere
intersects), when the surface of the model consists a lot of triangles ,the
time of computing intersection is very large! So  i will take your advice~~
       For another question, i also use the Nef to solve polyhedron Boolean
Operation , but i find it cost too,too,too many time. And I wanna to
know,whether the CGAL lib or other open lib can sovle the Boolean Operation
of 3D geometric polyhedrons. If exits, is there any request for constructing
the model?(Such as :not too many triangles, or precision of the model)?
     Because i know the 2D Boolean Operation is very  mature, so i want to
know  whether there is a good solution for the 3D Boolean Operation for any
3D geometric Objects!
     So please point me out , Thanks.
                     Yours   Chao M 



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/How-to-use-AABB-Tree-correctly-tp4657967p4657970.html
Sent from the cgal-discuss mailing list archive at Nabble.com.