From 09d09f8ef1e257b3bd7332a3b36dc7da2e9188cd Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 10 Sep 2020 15:48:07 +0100
Subject: [PATCH] polish

---
 .../doc/Bounding_volumes/CGAL/Min_sphere_d.h  |  2 +-
 .../CGAL/min_quadrilateral_2.h                | 27 ++++++++++---------
 2 files changed, 15 insertions(+), 14 deletions(-)

diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_d.h
index 1cb4b218c48..ca5a9956ea5 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_d.h
@@ -68,7 +68,7 @@ each take linear time.
 
 \cgalHeading{Example}
 
-\cgalExample{Min_sphere_d/min_sphere_d.cpp}
+\cgalExample{Min_sphere_d/min_sphere_homogeneous_d.cpp}
 
 */
 template< typename Traits >
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/min_quadrilateral_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/min_quadrilateral_2.h
index 8d5a65a2046..1197eebf4bb 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/min_quadrilateral_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/min_quadrilateral_2.h
@@ -3,6 +3,11 @@ namespace CGAL {
 /*!
 \ingroup PkgBoundingVolumesRef
 
+computes a minimum area enclosing parallelogram of the point set
+described by [`points_begin`, `points_end`), writes its
+vertices (counterclockwise) to `o` and returns the past-the-end
+iterator of this sequence.
+
 The function computes a minimum area enclosing
 parallelogram \f$ A(P)\f$ of a given convex point set \f$ P\f$. Note that
 \f$ R(P)\f$ is not necessarily axis-parallel, and it is in general not
@@ -11,10 +16,6 @@ parallelogram enclosing \f$ P\f$ - as a convex set - contains the convex
 hull of \f$ P\f$. For general point sets one has to compute the convex hull
 as a preprocessing step.
 
-computes a minimum area enclosing parallelogram of the point set
-described by [`points_begin`, `points_end`), writes its
-vertices (counterclockwise) to `o` and returns the past-the-end
-iterator of this sequence.
 If the input range is empty, `o` remains unchanged.
 
 If the input range consists of one element only, this point is written
@@ -74,6 +75,11 @@ namespace CGAL {
 /*!
 \ingroup PkgBoundingVolumesRef
 
+computes a minimum area enclosing rectangle of the point set described
+by [`points_begin`, `points_end`), writes its vertices
+(counterclockwise) to `o`, and returns the past-the-end iterator
+of this sequence.
+
 The function computes a minimum area enclosing rectangle
 \f$ R(P)\f$ of a given convex point set \f$ P\f$. Note that \f$ R(P)\f$ is not
 necessarily axis-parallel, and it is in general not unique. The focus
@@ -81,10 +87,6 @@ on convex sets is no restriction, since any rectangle enclosing
 \f$ P\f$ - as a convex set - contains the convex hull of \f$ P\f$. For general
 point sets one has to compute the convex hull as a preprocessing step.
 
-computes a minimum area enclosing rectangle of the point set described
-by [`points_begin`, `points_end`), writes its vertices
-(counterclockwise) to `o`, and returns the past-the-end iterator
-of this sequence.
 
 If the input range is empty, `o` remains unchanged.
 
@@ -143,6 +145,10 @@ namespace CGAL {
 /*!
 \ingroup PkgBoundingVolumesRef
 
+computes a minimum enclosing strip of the point set described by
+[`points_begin`, `points_end`), writes its two bounding lines
+to `o` and returns the past-the-end iterator of this sequence.
+
 The function computes a minimum width enclosing strip
 \f$ S(P)\f$ of a given convex point set \f$ P\f$. A strip is the closed region
 bounded by two parallel lines in the plane. Note that \f$ S(P)\f$ is not
@@ -151,10 +157,6 @@ parallelogram enclosing \f$ P\f$ - as a convex set - contains the convex
 hull of \f$ P\f$. For general point sets one has to compute the convex hull
 as a preprocessing step.
 
-computes a minimum enclosing strip of the point set described by
-[`points_begin`, `points_end`), writes its two bounding lines
-to `o` and returns the past-the-end iterator of this sequence.
-
 If the input range is empty or consists of one element only, `o`
 remains unchanged.
 
@@ -205,4 +207,3 @@ OutputIterator o,
 Traits& t = Default_traits);
 
 } /* namespace CGAL */
-