|
The BoxIntersectionBox_d concept is used in the context of the intersection algorithms for sequences of iso-oriented boxes. These algorithms come with a default traits class that assumes that the boxes are a model of this BoxIntersectionBox_d concept. This concept defines the access functions to the dimension, the id-number, and the boundaries of the box.
Assignable.
CGAL::Box_intersection_d::Box_d<NT,int D,IdPolicy>
CGAL::Box_intersection_d::Box_with_handle_d<NT, int D, Handle, IdPolicy>
| BoxIntersectionBox_d::NT | |
|
number type to represent the box
boundaries. Allowed are the built-in types int, unsigned int, float, and double.
| |
| BoxIntersectionBox_d::ID | |
|
type for the box id-number,
must be a model of the LessThanComparable concept.
| |
| int | BoxIntersectionBox_d::dimension () | |
| returns the dimension of the box. | ||
| ID | box.id () const | returns the unique id-number for the box. |
| NT | box.min_coord ( int d) const | returns the lower boundary in dimension d, 0 ≤ d < dimension(). |
| NT | box.max_coord ( int d) const | returns the upper boundary 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
CGAL::Box_intersection_d::Box_traits_d<BoxHandle>
BoxIntersectionTraits_d