\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.6 - Intersecting Sequences of dD Iso-oriented Boxes
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Modules
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-15a
License: GPL
Windows Demo: Operations on Polyhedra
Common Demo Dlls: dlls

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.