|
CGAL 6.0 - Intersecting Sequences of dD Iso-oriented Boxes
|
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 Types | |
| typedef unspecified_type | NT |
| number type to represent the box boundaries. | |
| typedef unspecified_type | ID |
type for the box id-number, must be a model of the LessThanComparable concept. | |
| static int | dimension () |
| returns the dimension of the box. | |
Access Functions | |
| ID | id () const |
returns the unique id-number for the box. | |
| NT | min_coord (int d) const |
returns the lower boundary in dimension d, \( 0 \leq\)d \( < \)dimension(). | |
| NT | max_coord (int d) const |
returns the upper boundary in dimension d, \( 0 \leq\)d \( < \)dimension(). | |
number type to represent the box boundaries.
Allowed are the built-in types int, unsigned int, float, and double.