/// \defgroup PkgBoxIntersectionDRef Reference Manual
/// \defgroup PkgBoxIntersectionDConcepts Concepts
/// \ingroup PkgBoxIntersectionDRef

/// \defgroup PkgBoxIntersectionDEnums Enumerations
/// \ingroup PkgBoxIntersectionDRef

/// \defgroup PkgBoxIntersectionDClasses Classes
/// \ingroup PkgBoxIntersectionDRef

/// \defgroup PkgBoxIntersectionD_box_intersection_d CGAL::box_intersection_d()
/// \ingroup PkgBoxIntersectionDRef


/// \defgroup PkgBoxIntersectionD_box_intersection_all_pairs_d CGAL::box_intersection_all_pairs_d()
/// \ingroup PkgBoxIntersectionDRef

/// \defgroup PkgBoxIntersectionD_box_self_intersection_d CGAL::box_self_intersection_d()
/// \ingroup PkgBoxIntersectionDRef

/// \defgroup PkgBoxIntersectionD_box_self_intersection_all_pairs_d CGAL::box_self_intersection_all_pairs_d()
/// \ingroup PkgBoxIntersectionDRef
/*!
\addtogroup PkgBoxIntersectionDRef

\todo de-math and change D to d for the dimension

\cgalPkgDescriptionBegin{Intersecting Sequences of dD Iso-oriented Boxes,PkgBoxIntersectionD}
\cgalPkgPicture{box_inters-small.png}
\cgalPkgSummaryBegin
\cgalPkgAuthors{Lutz Kettner, Andreas Meyer, and Afra Zomorodian}
\cgalPkgDesc{An efficient algorithm for finding all intersecting pairs for large numbers of iso-oriented boxes, in order to apply a user defined callback on them.  Typically these boxes will be bounding boxes of more complicated geometries. The algorithm is useful for (self-) intersection tests of surfaces etc. }
\cgalPkgManuals{Chapter_Intersecting_Sequences_of_dD_Iso-oriented_Boxes,PkgBoxIntersectionDRef}
\cgalPkgSummaryEnd
\cgalPkgShortInfoBegin
\cgalPkgSince{3.1}
\cgalPkgBib{cgal:kmz-isiobd}
\cgalPkgLicense{\ref licensesGPL  "GPL"}
\cgalPkgDemo{CGAL Lab,CGALlab.zip}
\cgalPkgShortInfoEnd
\cgalPkgDescriptionEnd

\cgalClassifedRefPages

\cgalCRPSection{Concepts}
- `BoxIntersectionBox_d`
- `BoxIntersectionTraits_d`

\cgalCRPSection{Enumerations}
- `CGAL::Box_intersection_d::Setting`
- `CGAL::Box_intersection_d::Topology`

\cgalCRPSection{Classes}
- `CGAL::Box_intersection_d::Box_d<NT,int D,IdPolicy>`
- `CGAL::Box_intersection_d::Box_with_handle_d<NT, int D, Handle, IdPolicy>`
- `CGAL::Box_intersection_d::Box_traits_d<BoxHandle>`

\cgalCRPSection{Functions}
- `CGAL::box_intersection_d`
- `CGAL::box_self_intersection_d`

- `CGAL::box_intersection_all_pairs_d`
- `CGAL::box_self_intersection_all_pairs_d`

*/
