CGAL 5.6.1 - Intersecting Sequences of dD Iso-oriented Boxes
Intersecting Sequences of dD Iso-oriented Boxes Reference

box_inters-small.png
Lutz Kettner, Andreas Meyer, and Afra Zomorodian
An efficient algorithm for finding all intersecting pairs for large numbers of iso-oriented boxes, in order to apply a user defined callback on them. Typically these boxes will be bounding boxes of more complicated geometries. The algorithm is useful for (self-) intersection tests of surfaces etc.
Introduced in: CGAL 3.1
BibTeX: cgal:kmz-isiobd-24a
License: GPL
Windows Demo: Polyhedron demo

Classified Reference Pages

Concepts

Classes

Functions

Modules

 Concepts
 
 Classes
 
 CGAL::box_intersection_d()
 The function box_intersection_d() computes the pairwise intersecting boxes between two sequences of iso-oriented boxes in arbitrary dimension.
 
 CGAL::box_intersection_all_pairs_d()
 The function box_intersection_all_pairs_d() computes the pairwise intersecting boxes between two sequences of iso-oriented boxes in arbitrary dimension.
 
 CGAL::box_self_intersection_d()
 The function box_self_intersection_d() computes the pairwise intersecting boxes in a sequence of iso-oriented boxes in arbitrary dimension.
 
 CGAL::box_self_intersection_all_pairs_d()
 The function box_self_intersection_all_pairs_d() computes the pairwise intersecting boxes in a sequence of iso-oriented boxes in arbitrary dimension.