Finds all intersecting pairs of leaf nodes in a 2D Bounding Volume Hierarchy (BVH).
Finds and collects pairs of intersecting leaf-nodes between two bipartite sets