cgal/Optimisation_doc/doc_tex/Bounded_volumes/PkgDescription.tex

19 lines
740 B
TeX

\begin{ccPkgDescription}{BoundingVolumes \label{Pkg:BoundingVolumes}}
\ccPkgHowToCiteCgal{cgal:fghhs-go-07}
\ccPkgSummary{
This package provides algorithms for computing bounding volumes
The algorithms for bounding volumes for point sets in
d-dimensional space are: the smallest enclosing sphere, annulus,
ellipsoid, or strip. For 2-dimensional space, a number of additional
volumes (rectangles, parallelograms, $k=2,3,4$ axis-aligned rectangles)
are available.
The smallest enclosing sphere algorithm can also be applied
on a set of d-dimensional spheres.}
%\ccPkgDependsOn{}
\ccPkgIntroducedInCGAL{1.1}
\ccPkgLicense{\ccLicenseQPL}
\ccPkgIllustration{Optimisation//minCircle.png}{Optimisation//minCircle.png}
\end{ccPkgDescription}