CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

You can use this package:
http://doc.cgal.org/latest/Box_intersection_d/index.html
and use an intersection predicate matching your need.

Sebastien.


On 02/04/2014 04:24 PM, 芮泽亚 wrote:
> Hi
> I mean the two polyhedrons touch(share a common point, edge, or face).
> It seems when I use the function, it will output the two polyhedrons
> intersect in this case.
> But in my problem, this case requires to be considered no intersection.
> Can you give me some hints about how to check this case?
>
> Thanks for your help.
> Vanessa
>
>
> 2014-02-04 Sebastien Loriot (GeometryFactory) 
> <
> <mailto:>>:
>
>     On 02/04/2014 02:27 PM, vanessa wrote:
>
>         Hi all
>
>         I'm trying to do the intersection test for two 3D polyhedrons
>         using the
>         function"CGAL::intersection___Polyhedron_3_Polyhedron_3(__Poly1,
>         Poly2,
>            std::back_inserter(polylines))__;".
>
>         It performs well.But when one polyhedron is in contact to the
>         other, the
>         output (size of polylines) shows 1 instead of 0. Is there any
>         method to
>         check the case that two polyhedrons are in contact?
>
>     What do you mean by in contact?
>     IIRC, note that this function is will not report intersection points.
>
>     Sebastien.
>
>
>
>         Many thanks
>         Vanessa
>
>
>
>         --
>         View this message in context:
>         
> http://cgal-discuss.949826.n4.__nabble.com/how-to-check-__whether-the-two-polyhedrons-__is-in-contact-tp4658761.html
>         
> <http://cgal-discuss.949826.n4.nabble.com/how-to-check-whether-the-two-polyhedrons-is-in-contact-tp4658761.html>
>         Sent from the cgal-discuss mailing list archive at Nabble.com.
>
>
>
>     --
>     You are currently subscribed to cgal-discuss.
>     To unsubscribe or access the archives, go to
>     https://sympa.inria.fr/sympa/__info/cgal-discuss
>     <https://sympa.inria.fr/sympa/info/cgal-discuss>