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

Changes according to test report by M. Hoffmann (97/02/13)

This commit is contained in:
Bernd Gärtner 1997-02-17 15:13:08 +00:00
parent d57c7531c6
commit fc26213e52
2 changed files with 20 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
Packages/Min_circle_2/doc_tex/Optimisation/Optimisation_ref/Min_circle_2.tex
View File

@ -16,7 +16,7 @@ An object of the class \ccClassTemplateName\ is the unique circle of
smallest area enclosing a finite set of points in two-dimensional smallest area enclosing a finite set of points in two-dimensional
euclidean space $\E_2$. For a point set $P$ we denote by $mc(P)$ the euclidean space $\E_2$. For a point set $P$ we denote by $mc(P)$ the
smallest circle that contains all points of $P$. Note that $mc(P)$ can smallest circle that contains all points of $P$. Note that $mc(P)$ can
be degenerate, i.e.\ $P=$\ccTexHtml{$\emptyset$}{Ø} if be degenerate, i.e.\ $mc(P)=$\ccTexHtml{$\emptyset$}{Ø} if
$P=$\ccTexHtml{$\emptyset$}{Ø} and $mc(P)=\{p\}$ if $P=\{p\}$. $P=$\ccTexHtml{$\emptyset$}{Ø} and $mc(P)=\{p\}$ if $P=\{p\}$.
An inclusion-minimal subset $S$ of $P$ with $mc(S)=mc(P)$ is called An inclusion-minimal subset $S$ of $P$ with $mc(S)=mc(P)$ is called
@ -32,6 +32,9 @@ $P$ may be empty or points may occur more than once. The algorithm
computes a support set $S$ which remains fixed until the next insert computes a support set $S$ which remains fixed until the next insert
operation. operation.
Correct results are in this release only guaranteed if the template
parameter of the representation class $R$ is an exact number type.
\ccCreation \ccCreation
\ccCreationVariable{min_circle} \ccCreationVariable{min_circle}
@ -136,10 +139,9 @@ the construction method is incremental itself.
enclosing circle.} enclosing circle.}
\ccMemberFunction{ void reserve( int n);}{ \ccMemberFunction{ void reserve( int n);}{
reserves storage for at least \ccStyle{n} points in \ccVar. reserves storage for at least \ccStyle{n} points in \ccVar. Although
It can be used, if the number of insert operations is known in this is in no case necessary, it may speed up memory allocation if
advance.} the number of points to be inserted is known in advance.}
\ccHeading{Check operation} \ccHeading{Check operation}
@ -184,7 +186,9 @@ unbounded side equals the whole plane $\E_2$.
degeneracy).} degeneracy).}
\ccMemberFunction{ bool is_degenerate( ) const;}{ \ccMemberFunction{ bool is_degenerate( ) const;}{
returns \ccStyle{true}, iff \ccVar\ is degenerate.} returns \ccStyle{true}, iff \ccVar\ is degenerate, i.e. if
\ccVar is empty or equal to a single point, equivalently if
the number of support points is less than 2.}
\ccImplementation \ccImplementation

16
Packages/Min_circle_2/doc_tex/basic/Optimisation/Optimisation_ref/Min_circle_2.tex
View File

@ -16,7 +16,7 @@ An object of the class \ccClassTemplateName\ is the unique circle of
smallest area enclosing a finite set of points in two-dimensional smallest area enclosing a finite set of points in two-dimensional
euclidean space $\E_2$. For a point set $P$ we denote by $mc(P)$ the euclidean space $\E_2$. For a point set $P$ we denote by $mc(P)$ the
smallest circle that contains all points of $P$. Note that $mc(P)$ can smallest circle that contains all points of $P$. Note that $mc(P)$ can
be degenerate, i.e.\ $P=$\ccTexHtml{$\emptyset$}{Ø} if be degenerate, i.e.\ $mc(P)=$\ccTexHtml{$\emptyset$}{Ø} if
$P=$\ccTexHtml{$\emptyset$}{Ø} and $mc(P)=\{p\}$ if $P=\{p\}$. $P=$\ccTexHtml{$\emptyset$}{Ø} and $mc(P)=\{p\}$ if $P=\{p\}$.
An inclusion-minimal subset $S$ of $P$ with $mc(S)=mc(P)$ is called An inclusion-minimal subset $S$ of $P$ with $mc(S)=mc(P)$ is called
@ -32,6 +32,9 @@ $P$ may be empty or points may occur more than once. The algorithm
computes a support set $S$ which remains fixed until the next insert computes a support set $S$ which remains fixed until the next insert
operation. operation.
Correct results are in this release only guaranteed if the template
parameter of the representation class $R$ is an exact number type.
\ccCreation \ccCreation
\ccCreationVariable{min_circle} \ccCreationVariable{min_circle}
@ -136,10 +139,9 @@ the construction method is incremental itself.
enclosing circle.} enclosing circle.}
\ccMemberFunction{ void reserve( int n);}{ \ccMemberFunction{ void reserve( int n);}{
reserves storage for at least \ccStyle{n} points in \ccVar. reserves storage for at least \ccStyle{n} points in \ccVar. Although
It can be used, if the number of insert operations is known in this is in no case necessary, it may speed up memory allocation if
advance.} the number of points to be inserted is known in advance.}
\ccHeading{Check operation} \ccHeading{Check operation}
@ -184,7 +186,9 @@ unbounded side equals the whole plane $\E_2$.
degeneracy).} degeneracy).}
\ccMemberFunction{ bool is_degenerate( ) const;}{ \ccMemberFunction{ bool is_degenerate( ) const;}{
returns \ccStyle{true}, iff \ccVar\ is degenerate.} returns \ccStyle{true}, iff \ccVar\ is degenerate, i.e. if
\ccVar is empty or equal to a single point, equivalently if
the number of support points is less than 2.}
\ccImplementation \ccImplementation