CGAL users discussion list

[Thiago Milanetto Schlittler <>]

Hello!

   I’m working on an algorithm where I need to determinate the polyhedral intersections between the cells (tetrahedrons) of two different 3D meshes. Searching a bit on the mailing list’s archives, I’ve found some pointers on how to find these intersections [1] with CGAL, but I still have to filter out the polygonal intersections. Is there any method inside CGAL that tests if a set of points are all inside the same plane? This is not hard to do by hand, but I’d wager that if CGAL has such a method, it would be more efficient than my own code.

Thanks in advance,

Thiago

[1] http://cgal-discuss.949826.n4.nabble.com/Intersection-of-two-CONVEX-3D-polyhedrons-td4564202.html