CGAL users discussion list

[rong tian <>]

I apologize if this message has been sent times as the message has been rejected twice.

Hello,

I am new to CGAL but got some basic experience in using it.
I am looking for an efficient approach to finding the intersection of a
cuboid and a tetrahedron.

Currently, I am following the post
http://cgal-discuss.949826.n4.nabble.com/Intersection-of-two-CONVEX-3D-polyhedrons-td4564202.html
and using the operation N1 * N2 as suggested on the post.
But it is not efficient and in fact VERY slow.

Anyone can help me with an even more efficient usage of CGAL or the
similar library to do this.
If any possibility, a simple tutorial example would be mostly appreciated.

Thank you very much and I appreciate your any hint.

Rong