CGAL users discussion list

[<>]

I'm new to CGAL. I currently use OpenCascade to do Boolean operations but I've
found it is too slow for my needs. I've read that the CGAL Nef_polyhedron_3 
has
optimizations for these operations. I'd be grateful if you could tell me if
CGAL can compute the following.

I have two closed solids bounded by triangle meshes, call them A and B.

First, I'd like to cut one with the other, i.e. compute C=A-B. The result C
should be a closed polyhedron, and I'd like to convert it to a triangle mesh.

To my understanding, I can do the cut with Nef_polyhedron_3::difference(). So
far so good.

Second, I'd like to identify the set of triangles in C which "came from B",
i.e. the set in intersect(C,B). How would I find these set?

Thanks.