Fix \E_* to \E^* thinko/copy-pasto.

Remove one more \ccTexHtml as well.
This commit is contained in:
Sylvain Pion 2009-01-03 14:29:04 +00:00
parent 36a53b8873
commit 3fab8f07fb
9 changed files with 17 additions and 17 deletions

View File

@ -14,7 +14,7 @@
An object of the class \ccRefName\ is the unique annulus (region between An object of the class \ccRefName\ is the unique annulus (region between
two concentric spheres with radii $r$ and $R$, $r \leq R$) enclosing a two concentric spheres with radii $r$ and $R$, $r \leq R$) enclosing a
finite set of points in $d$-dimensional Euclidean space $\E_d$, where the finite set of points in $d$-dimensional Euclidean space $\E^d$, where the
difference $R^2-r^2$ is minimal. For a point set $P$ we denote by $ma(P)$ difference $R^2-r^2$ is minimal. For a point set $P$ we denote by $ma(P)$
the smallest annulus that contains all points of $P$. Note that $ma(P)$ the smallest annulus that contains all points of $P$. Note that $ma(P)$
can be degenerate\lcTex{\ccIndexSubitem[t]{degeneracies}{\ccFont Min_annulus_d}}, can be degenerate\lcTex{\ccIndexSubitem[t]{degeneracies}{\ccFont Min_annulus_d}},
@ -236,7 +236,7 @@ two-, three-, and $d$-dimensional \cgal~kernel, respectively.
The bounded area of the smallest enclosing annulus lies between the inner The bounded area of the smallest enclosing annulus lies between the inner
and the outer sphere. The boundary is the union of both spheres. By and the outer sphere. The boundary is the union of both spheres. By
definition, an empty annulus has no boundary and no bounded side, i.e.~its definition, an empty annulus has no boundary and no bounded side, i.e.~its
unbounded side equals the whole space $\E_d$. unbounded side equals the whole space $\E^d$.
\ccMemberFunction{ CGAL::Bounded_side \ccMemberFunction{ CGAL::Bounded_side
bounded_side( const Point& p) const;}{ bounded_side( const Point& p) const;}{

View File

@ -83,12 +83,12 @@ The following predicate is only needed, if the member function
\ccDefinition \ccDefinition
An object of the class \ccClassName\ is a circle in two-dimensional An object of the class \ccClassName\ is a circle in two-dimensional
Euclidean plane $\E_2$. Its boundary splits the plane into a bounded Euclidean plane $\E^2$. Its boundary splits the plane into a bounded
and an unbounded side. By definition, an empty \ccClassName\ has no and an unbounded side. By definition, an empty \ccClassName\ has no
boundary and no bounded side, i.e.\ its unbounded side equals the boundary and no bounded side, i.e.\ its unbounded side equals the
whole plane $\E_2$. A \ccClassName\ containing exactly one point~$p$ whole plane $\E^2$. A \ccClassName\ containing exactly one point~$p$
has no bounded side, its boundary is $\{p\}$, and its unbounded side has no bounded side, its boundary is $\{p\}$, and its unbounded side
equals $\E_2\mbox{\ccTexHtml{$\setminus$}{-}}\{p\}$. equals $\E^2 \setminus \{p\}$.
% ----------------------------------------------------------------------------- % -----------------------------------------------------------------------------
\ccTypes \ccTypes

View File

@ -15,7 +15,7 @@
An object of the class \ccRefName\ is the unique circle of smallest area An object of the class \ccRefName\ is the unique circle of smallest area
enclosing a finite (multi)set of points in two-dimensional Euclidean enclosing a finite (multi)set of points in two-dimensional Euclidean
space~$\E_2$. For a point set $P$ we denote by $mc(P)$ the smallest circle 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 be that contains all points of $P$. Note that $mc(P)$ can be
degenerate\lcTex{\ccIndexSubitem[t]{degeneracies}{\ccFont Min_circle_2}}, degenerate\lcTex{\ccIndexSubitem[t]{degeneracies}{\ccFont Min_circle_2}},
i.e.~$mc(P)=\emptyset$ if i.e.~$mc(P)=\emptyset$ if
@ -173,7 +173,7 @@ $S$ of $P$.
\ccIndexMemberFunctionGroup{predicates} \ccIndexMemberFunctionGroup{predicates}
By definition, an empty \ccClassTemplateName\ has no boundary and no By definition, an empty \ccClassTemplateName\ has no boundary and no
bounded side, i.e.\ its unbounded side equals the whole space $\E_2$. bounded side, i.e.\ its unbounded side equals the whole space $\E^2$.
\ccMemberFunction{ CGAL::Bounded_side \ccMemberFunction{ CGAL::Bounded_side
bounded_side( const Point& p) const;}{ bounded_side( const Point& p) const;}{

View File

@ -62,10 +62,10 @@ Only default and copy constructor are required.
\ccDefinition \ccDefinition
An object of the class \ccClassName\ is an ellipse in two-dimensional An object of the class \ccClassName\ is an ellipse in two-dimensional
Euclidean plane $\E_2$. Its boundary splits the plane into a bounded Euclidean plane $\E^2$. Its boundary splits the plane into a bounded
and an unbounded side. By definition, an empty \ccClassName\ has no and an unbounded side. By definition, an empty \ccClassName\ has no
boundary and no bounded side, i.e.\ its unbounded side equals the boundary and no bounded side, i.e.\ its unbounded side equals the
whole plane $\E_2$. whole plane $\E^2$.
% ----------------------------------------------------------------------------- % -----------------------------------------------------------------------------
\ccTypes \ccTypes

View File

@ -14,7 +14,7 @@
An object of the class \ccRefName\ is the unique ellipse of smallest area An object of the class \ccRefName\ is the unique ellipse of smallest area
enclosing a finite (multi)set of points in two-dimensional euclidean enclosing a finite (multi)set of points in two-dimensional euclidean
space~$\E_2$. For a point set $P$ we denote by $me(P)$ the smallest space~$\E^2$. For a point set $P$ we denote by $me(P)$ the smallest
ellipse that contains all points of $P$. Note that $me(P)$ can be ellipse that contains all points of $P$. Note that $me(P)$ can be
degenerate\lcTex{\ccIndexSubitem[t]{degeneracies}{\ccFont Min_ellipse_2}}, degenerate\lcTex{\ccIndexSubitem[t]{degeneracies}{\ccFont Min_ellipse_2}},
i.e.~$me(P)=\emptyset$ if i.e.~$me(P)=\emptyset$ if
@ -184,7 +184,7 @@ reconstructing $me(P)$ from a given support set\lcTex{\ccIndexSubitem[t]{support
\ccIndexMemberFunctionGroup{predicates} \ccIndexMemberFunctionGroup{predicates}
By definition, an empty \ccRefName\ has no boundary and no bounded side, By definition, an empty \ccRefName\ has no boundary and no bounded side,
i.e.\ its unbounded side equals the whole space $\E_2$. i.e.\ its unbounded side equals the whole space $\E^2$.
\ccMemberFunction{ CGAL::Bounded_side \ccMemberFunction{ CGAL::Bounded_side
bounded_side( const Point& p) const;}{ bounded_side( const Point& p) const;}{

View File

@ -62,10 +62,10 @@ Only default and copy constructor are required.
\ccDefinition \ccDefinition
An object of the class \ccClassName\ is an ellipse in two-dimensional An object of the class \ccClassName\ is an ellipse in two-dimensional
Euclidean plane $\E_2$. Its boundary splits the plane into a bounded Euclidean plane $\E^2$. Its boundary splits the plane into a bounded
and an unbounded side. By definition, an empty \ccClassName\ has no and an unbounded side. By definition, an empty \ccClassName\ has no
boundary and no bounded side, i.e.\ its unbounded side equals the boundary and no bounded side, i.e.\ its unbounded side equals the
whole plane $\E_2$. whole plane $\E^2$.
% ----------------------------------------------------------------------------- % -----------------------------------------------------------------------------
\ccTypes \ccTypes

View File

@ -12,7 +12,7 @@
An object of the class \ccRefName\ is the unique sphere of An object of the class \ccRefName\ is the unique sphere of
smallest volume enclosing a finite (multi)set of points in $d$-dimensional smallest volume enclosing a finite (multi)set of points in $d$-dimensional
Euclidean space $\E_d$. For a set $P$ we denote by $ms(P)$ the Euclidean space $\E^d$. For a set $P$ we denote by $ms(P)$ the
smallest sphere that contains all points of $P$. $ms(P)$ can smallest sphere that contains all points of $P$. $ms(P)$ can
be degenerate, i.e.\ $ms(P)=\emptyset$ be degenerate, i.e.\ $ms(P)=\emptyset$
if $P=\emptyset$ and $ms(P)=\{p\}$ if if $P=\emptyset$ and $ms(P)=\{p\}$ if
@ -162,7 +162,7 @@ divide.
\ccIndexMemberFunctionGroup{predicates} \ccIndexMemberFunctionGroup{predicates}
By definition, an empty \ccRefName\ has no boundary and no By definition, an empty \ccRefName\ has no boundary and no
bounded side, i.e.\ its unbounded side equals the whole space $\E_d$. bounded side, i.e.\ its unbounded side equals the whole space $\E^d$.
\ccMemberFunction{ Bounded_side \ccMemberFunction{ Bounded_side
bounded_side( const Point& p) const;}{ bounded_side( const Point& p) const;}{

View File

@ -10,7 +10,7 @@
An object of the class \ccRefName\ is a data structure that represents An object of the class \ccRefName\ is a data structure that represents
the unique sphere of smallest volume enclosing a finite set of spheres the unique sphere of smallest volume enclosing a finite set of spheres
in $d$-dimensional Euclidean space $\E_d$. For a set $S$ of spheres in $d$-dimensional Euclidean space $\E^d$. For a set $S$ of spheres
we denote by $ms(S)$ the smallest sphere that contains all spheres of we denote by $ms(S)$ the smallest sphere that contains all spheres of
$S$; we call $ms(S)$ the \emph{minsphere} of $S$. $ms(S)$ can be $S$; we call $ms(S)$ the \emph{minsphere} of $S$. $ms(S)$ can be
degenerate, i.e., $ms(S)=\emptyset$, degenerate, i.e., $ms(S)=\emptyset$,

View File

@ -16,7 +16,7 @@
An object of the class \ccRefName\ represents the (squared) distance An object of the class \ccRefName\ represents the (squared) distance
between two convex polytopes, given as the convex hulls of two finite point between two convex polytopes, given as the convex hulls of two finite point
sets in $d$-dimensional Euclidean space $\E_d$. For point sets $P$ and $Q$ sets in $d$-dimensional Euclidean space $\E^d$. For point sets $P$ and $Q$
we denote by $pd(P,Q)$ the distance between the convex hulls of $P$ and we denote by $pd(P,Q)$ the distance between the convex hulls of $P$ and
$Q$. Note that $pd(P,Q)$ can be $Q$. Note that $pd(P,Q)$ can be
degenerate\lcTex{\ccIndexSubitem[t]{degeneracies}{\ccFont Polytope_distance_d}}, degenerate\lcTex{\ccIndexSubitem[t]{degeneracies}{\ccFont Polytope_distance_d}},