We provide an efficient algorithm [ZE02] for finding all intersecting1 pairs for large numbers of iso-oriented boxes, i.e., typically these will be bounding boxes of more complicated geometries. For comparison and as a base case for other methods, we also offer the simple all-pairs test as a generic function.
BoxIntersectionBox_d
BoxIntersectionTraits_d
CGAL::Box_intersection_d::Box_d<NT,int D,IdPolicy>
CGAL::Box_intersection_d::Box_with_handle_d<NT, int D, Handle, IdPolicy>
CGAL::Box_intersection_d::Box_traits_d<BoxHandle>
CGAL::box_intersection_d
CGAL::box_self_intersection_d
CGAL::box_intersection_all_pairs_d
CGAL::box_self_intersection_all_pairs_d
| 1 | Boxes represent volumes or point-sets. So, intersection means intersection of the point-set enclosed by the box and not only intersection of the boundary, of course. |