|
The BoxIntersectionTraits_d concept is used for the intersection algorithms for sequences of iso-oriented boxes. This concept defines the access functions to the dimension, the id-number, and the boundaries of the boxes manipulated in these algorithms.
Assignable.
CGAL::Box_intersection_d::Box_traits_d<BoxHandle>
|
| |
|
type used for passing box parameters in the
functions below. Since we support in our algorithms
passing the boxes by value as well as passing them as pointers, this
type can be either const B&, B*, or const B*
respectively, where B is the actual box type. The difference
to the box handle type lies in the first case where the box handle
would be B where this type is const B&.
| |
|
| |
|
number type to represent the box
boundaries. Allowed are the built-in types int, unsigned int, float, and double.
| |
|
| |
|
type for the id-number,
model of the LessThanComparable concept.
| |
|
|
| |
| returns the dimension of the box. | ||
|
|
| |
| returns the unique id-number for the box. | ||
|
|
| |
| returns the lower boundary of the box in dimension d, 0 ≤ d < dimension(). | ||
|
|
| |
| returns the upper boundary of the box in dimension d, 0 ≤ d < dimension(). | ||
CGAL::box_intersection_d
CGAL::box_self_intersection_d
CGAL::box_intersection_all_pairs_d
CGAL::box_self_intersection_all_pairs_d