CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

A simple to implement method (but far from optimal) is to compute the
intersection of triangles from A with triangles from B (using [1] for 
example).

You then have a set of segments, triangles and points (or nothing in
the case the polyhedra don't intersect).
You simply need to compute the convex hull of all the endpoints of the
segments and triangles, and the points using [2].

Sebastien.

[1] 
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Box_intersection_d/Chapter_main.html
[2]http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Convex_hull_3/Chapter_main.html#Subsection_16.2.3

On 04/17/2012 11:51 AM, sgdimitris wrote:
> I would like to ask which is the easiest and fastest way to calculate the
> intersection of two *CONVEX* 3D polyhedrons?
> I *don't* want only to see if the two polyhedrons are intersected but also
> to calculate the polyhedron that is their intersection!
> Best regards,
> Dimitris
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Intersection-of-two-CONVEX-3D-polyhedrons-tp4564202p4564202.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.