Subject: CGAL users discussion list
List archive
- From: scud <>
- To:
- Subject: [cgal-discuss] Check whether two polyhedron_3 are intersection
- Date: Thu, 28 Mar 2013 06:35:57 -0700 (PDT)
How to check whether two polyhedron_3 are intersection or not efficiently. I
tried to use nef_polyhedron_3, but it is too slow. And I don't need to know
the area of intersection. I am thinking maybe using AABB Tree, but it seems
that I cannot do_intersection two AABB Trees directly. Please give me some
clue.
Thanks
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Check-whether-two-polyhedron-3-are-intersection-tp4657064.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Check whether two polyhedron_3 are intersection, scud, 03/28/2013
- Re: [cgal-discuss] Check whether two polyhedron_3 are intersection, Sebastien Loriot (GeometryFactory), 03/28/2013
Archive powered by MHonArc 2.6.18.