Intersecting Sequences of dD Iso-oriented Boxes
Reference Manual

Lutz Kettner, Andreas Meyer, and Afra Zomorodian

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.

61.12   Classified Reference Pages

Concepts

BoxIntersectionBox_d
BoxIntersectionTraits_d

Classes

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>

Functions

CGAL::box_intersection_d
CGAL::box_self_intersection_d

CGAL::box_intersection_all_pairs_d
CGAL::box_self_intersection_all_pairs_d

61.13   Alphabetical List of Reference Pages

BoxIntersectionBox_d
BoxIntersectionTraits_d
box_intersection_all_pairs_d
Box_intersection_d::Box_d<NT,int D,IdPolicy>
Box_intersection_d::Box_traits_d<BoxHandle>
Box_intersection_d::Box_with_handle_d<NT, int D, Handle, IdPolicy>
box_intersection_d
box_self_intersection_all_pairs_d
box_self_intersection_d


Footnotes

 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.