CGAL users discussion list

[Andre Massing <>]

Hi!

I have two distinct AABB tree hierarchies and want to traverse them (for 
finding all the pairs of intersections) via a depth-first search and 
some descent rules (e.g. biggest volume).
Is there any possibility to accomplish that? At a first glance the 
interface for the AABB trees seems to provide query member functions,
but not possibility for traversing.
I don't want to use related package for intersecting sequences of dD 
Iso-oriented box since I may use the AABB hierarchy for other purposes 
as well (Actually the AABB tree is used for a FEM mesh and other queries 
like distance or point location might occur).

Any pointers or comments are highly appreciated!

Best regards,
Andre

--
André Massing                   email: 

Ph.D. student                   mobile: +47 469 57 401
Simula Research Laboratory
NO-1367 Fornebu, Norway