CGAL users discussion list

[Richard Downe <>]

I would guess you could increase the speed by using 
AABB_tree::any_intersected_primitive(), if anything would, since that 
will terminate after finding any nonempty subset, and then follow up 
with an NEF polyhedron intersection to get the precise overlap upon 
finding that an intersection exists.
--rd

On 08/23/2011 05:16 PM, Robert W. Johnstone wrote:
> 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