This commit is contained in:
Andreas Fabri 2007-04-02 09:58:12 +00:00
parent a722db5ae7
commit 4910117ccb
1 changed files with 4 additions and 4 deletions

View File

@ -1,9 +1,9 @@
\begin{ccPkgDescription}{BoundingVolumes \label{Pkg:BoundingVolumes}}
\ccPkgHowToCiteCgal{cgal:fghhs-go-07}
\begin{ccPkgDescription}{Bounding Volumes \label{Pkg:BoundingVolumes}}
\ccPkgHowToCiteCgal{cgal:fghhs-bv-07}
\ccPkgSummary{
This package provides algorithms for computing bounding volumes
The algorithms for bounding volumes for point sets in
The algorithms 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)
@ -14,5 +14,5 @@ on a set of d-dimensional spheres.}
%\ccPkgDependsOn{}
\ccPkgIntroducedInCGAL{1.1}
\ccPkgLicense{\ccLicenseQPL}
\ccPkgIllustration{Optimisation//minCircle.png}{Optimisation//minCircle.png}
\ccPkgIllustration{Bounded_volumes/minCircle.png}{Bounded_volumes/minCircle.png}
\end{ccPkgDescription}