songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

polish

This commit is contained in:
Andreas Fabri 2020-09-10 15:48:07 +01:00
parent a3d3bb80d9
commit 09d09f8ef1
2 changed files with 15 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_d.h
View File

@ -68,7 +68,7 @@ each take linear time.
\cgalHeading{Example} \cgalHeading{Example}
\cgalExample{Min_sphere_d/min_sphere_d.cpp} \cgalExample{Min_sphere_d/min_sphere_homogeneous_d.cpp}
*/ */
template< typename Traits > template< typename Traits >

27
Bounding_volumes/doc/Bounding_volumes/CGAL/min_quadrilateral_2.h
View File

@ -3,6 +3,11 @@ namespace CGAL {
/*! /*!
\ingroup PkgBoundingVolumesRef \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 The function computes a minimum area enclosing
parallelogram \f$ A(P)\f$ of a given convex point set \f$ P\f$. Note that 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 \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 hull of \f$ P\f$. For general point sets one has to compute the convex hull
as a preprocessing step. 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 is empty, `o` remains unchanged.
If the input range consists of one element only, this point is written If the input range consists of one element only, this point is written
@ -74,6 +75,11 @@ namespace CGAL {
/*! /*!
\ingroup PkgBoundingVolumesRef \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 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 \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 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 \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. 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. If the input range is empty, `o` remains unchanged.
@ -143,6 +145,10 @@ namespace CGAL {
/*! /*!
\ingroup PkgBoundingVolumesRef \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 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 \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 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 hull of \f$ P\f$. For general point sets one has to compute the convex hull
as a preprocessing step. 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` If the input range is empty or consists of one element only, `o`
remains unchanged. remains unchanged.
@ -205,4 +207,3 @@ OutputIterator o,
Traits& t = Default_traits); Traits& t = Default_traits);
} /* namespace CGAL */ } /* namespace CGAL */