Box_intersection_d::Box_d<NT,int D,IdPolicy> is a generic iso-oriented bounding box in dimension . 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 iso-oriented boxes. For degeneracy handling, the boxes need to provide a unique id-number. 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 built-in types int, unsigned int, float, and double.
|
|
| type for the box id-number. |
| |||
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]], .
| |||
| |||
constructs from bbox
| |||
| |||
constructs from bbox
|
|
| returns , the dimension of the box. | ||
|
|
returns a unique box id, see the
IdPolicy template parameter above for the different
choices.
| ||
|
|
returns the lower boundary in dimension d
| ||
|
|
returns the upper boundary in dimension d
| ||
|
|
returns the bounding box
| ||
|
|
returns the bounding box
| ||
|
| extends box to the smallest box that additionally contains the point represented by coordinates in p. | ||
|
| |||
extends box to the smallest box that additionally contains the point represented by coordinate intervals in p. |
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