CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Plane_3::has_on_positive_side ?
http://doc.cgal.org/latest/Kernel_23/classCGAL_1_1Plane__3.html#a2ca90cac980833ff38dd12dcb9858baf

Sebastien.


On 07/31/2015 05:04 PM, Thiago Milanetto Schlittler wrote:
> 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