CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

It is not working out of the box. This would need to define an 
intersection function of a polyhedron with a triangle using
for example another AABB-tree.

One solution if your only interested in the intersection polyline is to use

template <typename Polyhedron, typename OutputIterator>
OutputIterator
intersection_Polyhedron_3_Polyhedron_3(const Polyhedron& P, const 
Polyhedron& Q, OutputIterator out)
{
  return Intersection_of_Polyhedra_3<Polyhedron>()(P,Q,out);
}

out should be an output iterator of std::vector<Point_3>

defined in include/CGAL/intersection_of_Polyhedra_3.h (but not documented).

Otherwise you can use the package Intersecting Sequences of dD
Iso-oriented Boxes [1] (which is what the aforementioned function
uses).

Sebastien.

[1] http://doc.cgal.org/latest/Box_intersection_d


On 11/19/2015 06:16 PM, houssen wrote:
> Hello,
>
> Is it possible to intersect polyhedrons with AABB_tree ?
>
> For now I end up with this code, but impossible to compile the last line
> of the main !...
> Can somebody give me some clue / help on this ?
>
> Franck