## BoxIntersectionTraits_d

### Definition

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.

### Refines

Assignable.

### Has Models

CGAL::Box_intersection_d::Box_traits_d<BoxHandle>

### Types

BoxIntersectionTraits_d::Box_parameter
| 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&.
BoxIntersectionTraits_d::NT
| number type to represent the box boundaries. Allowed are the builtin types int, unsigned int, float, and double.
BoxIntersectionTraits_d::ID
| type for the id-number, model of the LessThanComparable concept.

### Access Functions

int | BoxIntersectionTraits_d::dimension ()
|  | returns the dimension of the box.
ID | BoxIntersectionTraits_d::id ( Box_parameter box)
|  | returns the unique id-number for the box.

NT

BoxIntersectionTraits_d::min_coord ( | Box_parameter box, int d)

|  | returns the lower boundary of the box in dimension d, 0 d < dimension().

NT

BoxIntersectionTraits_d::max_coord ( | Box_parameter box, int d)

|  | returns the upper boundary of the box in dimension d, 0 d < dimension().

### See Also

CGAL::box_intersection_d
CGAL::box_self_intersection_d
CGAL::box_intersection_all_pairs_d
CGAL::box_self_intersection_all_pairs_d