Box_intersection_d::Box_d<NT,int D,IdPolicy> is a generic isooriented bounding box in dimension $$D. It provides in each dimension an interval with lower and upper endpoints represented with the number type NT. This class is designed to work smoothly with the algorithms for intersecting sequences of isooriented boxes. For degeneracy handling, the boxes need to provide a unique idnumber. The policy parameter IdPolicy offers several choices. The template parameters have to comply with the following requirements:
#include <CGAL/Box_intersection_d/Box_d.h>
and also automatically with
#include <CGAL/box_intersection_d.h>
 
number type to represent the box
boundaries. Allowed are the builtin types int, unsigned int, float, and double.

 
 type for the box idnumber. 
 
Default constructor. No particular initialization.
 
 
initializes to the complete or
the empty space. If empty, all interval starting(end) points will be
set to positive(negative) infinity.
 
 
initializes the box
intervals to [lo[i],hi[i]], $$0 i < D. Precondition: lo[i] $$< hi[i] for $$0 i < D.
 
 
constructs from bbox,
exists iff $$D=2 and NT$$ double.
 
 
constructs from bbox,
exists iff $$D=3 and NT$$ double.


 
returns $$D, the dimension of the box.  

 returns a unique box id, see the IdPolicy template parameter above for the different choices. Does not exist if ID_NONE has been chosen for the IdPolicy. 

 
returns the lower boundary in dimension d, $$0 d$$ < D.  

 
returns the upper boundary in dimension d, $$0 d$$ < D.  

 returns the bounding box iff $$D=2 and NT$$ double. 

 returns the bounding box iff $$D=3 and NT$$ double. 
CGAL::box_intersection_d
CGAL::box_self_intersection_d
CGAL::box_intersection_all_pairs_d
CGAL::box_self_intersection_all_pairs_d
CGAL::Box_intersection_d::Box_with_handle_d<NT, int D, Handle, IdPolicy>
CGAL::Box_intersection_d::Box_traits_d<BoxHandle>
BoxIntersectionTraits_d