CGAL users discussion list

["Robert W. Johnstone" <>]

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