Subject: CGAL users discussion list
List archive
- From: "Robert W. Johnstone" <>
- To:
- Subject: [cgal-discuss] Test for intersection of Nef_polyhedron_3
- Date: Tue, 23 Aug 2011 18:16:35 -0400
Hello Everyone,
I'm wondering if there is a fast way to test if the intersection of
two NEF polyhedra would return a non-empty set. I understand that one
could get the result with a call of !N1.intersect(N2).is_empty(), but
suspect a dedicated method could be much faster. Does such a method
exist? If not, are there any suggestions on implementing this
extension?
Thank-you,
Robert
- [cgal-discuss] Test for intersection of Nef_polyhedron_3, Robert W. Johnstone, 08/24/2011
- Re: [cgal-discuss] Test for intersection of Nef_polyhedron_3, Richard Downe, 08/24/2011
Archive powered by MHonArc 2.6.16.