Box_intersection_d: Fix doc link

Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt

@@ -216,7 +216,7 @@ boxes and approximated geometry, which is the case here. It saves us
 the extra space that was needed for the explicit `id`-number in
 the previous example.
 
-We run the self intersection algorithm with the `report_inters`
+We run the self intersection algorithm with the `report_inters()`
 function as callback. This callback reports the intersecting boxes. It
 uses the `handle` and the global `triangles` vector to
 calculate the triangle numbers. Then it checks the triangles
@@ -480,4 +480,3 @@ however, we learned too late about this implementation.
 
 */
 } /* namespace CGAL */
-

Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_traits_d.h

@@ -47,12 +47,12 @@ Box_traits_d();
 
 
 /*!
-\ingroup PkgBoxIntersectionDFunctions
+\ingroup PkgBoxIntersectionDEnums
 */
 enum Setting  { COMPLETE, BIPARTITE };
 
 /*!
-\ingroup PkgBoxIntersectionDFunctions
+\ingroup PkgBoxIntersectionDEnums
 */
 enum Topology { HALF_OPEN, CLOSED };
 

Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt

@@ -2,6 +2,9 @@
 /// \defgroup PkgBoxIntersectionDConcepts Concepts
 /// \ingroup PkgBoxIntersectionDRef
 
+/// \defgroup PkgBoxIntersectionDEnums Enumerations
+/// \ingroup PkgBoxIntersectionDRef
+
 /// \defgroup PkgBoxIntersectionDClasses Classes
 /// \ingroup PkgBoxIntersectionDRef
 
@@ -43,6 +46,10 @@
 - `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>`
@@ -56,4 +63,3 @@
 - `CGAL::box_self_intersection_all_pairs_d`
 
 */
-

Box_intersection_d/doc/Box_intersection_d/dependencies

@@ -4,3 +4,4 @@ STL_Extension
 Algebraic_foundations
 Circulator
 Stream_support
+Polyhedron