CGAL 6.2 - Intersecting Sequences of dD Iso-oriented Boxes

Loading...
Searching...
No Matches
List of all members
BoxIntersectionBox_d Concept Reference
Reference Manual » Concepts

## Definition

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.

Refines
  `Assignable`

Has models
  `CGAL::Box_intersection_d::Box_d`
  `CGAL::Box_intersection_d::Box_with_handle_d`

See also
  `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`

## 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()`.

## Member Typedef Documentation

## ◆ NT

typedef unspecified_type BoxIntersectionBox_d::NT

number type to represent the box boundaries.

Allowed are the built-in types `int`, `unsigned int`, `float`, and `double`.