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

fixed typos

This commit is contained in:
Andreas Fabri 2007-02-21 21:27:32 +00:00
parent 74278638a7
commit a6a80f6855
5 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Kinetic_data_structures/doc_tex/Kinetic_data_structures/kds_intro.tex
View File

@ -84,7 +84,7 @@ where this equivalence is exploited.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{description} \begin{description}
\item[primitive] The basic geometric types--i.e.\ the points of a \item[primitive] The basic geometric types, e.g., the points of a
triangulation. A primitive has a set of {\em coordinates}. triangulation. A primitive has a set of {\em coordinates}.
\item[combinatorial structure] A structure built on top of the \item[combinatorial structure] A structure built on top of the
primitives. The structure does not depend directly on the primitives. The structure does not depend directly on the

6
Kinetic_data_structures/doc_tex/Kinetic_data_structures/main.tex
View File

@ -25,7 +25,7 @@ associate with a real number key). You can imagine placing each of the
items on the point on the real line corresponding to its key. Now, let items on the point on the real line corresponding to its key. Now, let
the key for each item change continuously (i.e. no jumps are allowed). the key for each item change continuously (i.e. no jumps are allowed).
As long as no two (consecutive) items cross, the sorted order is As long as no two (consecutive) items cross, the sorted order is
intact. When two cross, they need to be exchanged in the list and then intact. When two items cross, they need to be exchanged in the list and then
the sorted order is once again correct. This is a trivial example of a the sorted order is once again correct. This is a trivial example of a
kinetic data structure. The key observation is that the combinatorial kinetic data structure. The key observation is that the combinatorial
structure which is maintained changes at discrete times (events) even structure which is maintained changes at discrete times (events) even
@ -37,8 +37,8 @@ Chapter~\ref{chapter-kinetic}. We first, in
Section~\ref{sec:kds_intro} introduce kinetic data structures and Section~\ref{sec:kds_intro} introduce kinetic data structures and
sweepline algorithms. This section can be skipped if the reader is sweepline algorithms. This section can be skipped if the reader is
already familiar with the area. The next sections, already familiar with the area. The next sections,
Section~\ref{sec:kds_terms} and Section~\ref{sec:kds_overview} introduces Section~\ref{sec:kds_terms} and Section~\ref{sec:kds_overview} introduce
the terms and gives an overview of the framework. They are recommended the terms and give an overview of the framework. They are recommended
reading for all readers, even if you are just using provided kinetic reading for all readers, even if you are just using provided kinetic
data structures. We then present kinetic data structures for Delaunay data structures. We then present kinetic data structures for Delaunay
triangulations in two and three dimensions in triangulations in two and three dimensions in

2
Kinetic_data_structures/doc_tex/Kinetic_data_structures/overview.tex
View File

@ -60,7 +60,7 @@ structure interacts with the various parts. The main concepts are
data structures will also use the \ccc{Kinetic::InstantaneousKernel} in order data structures will also use the \ccc{Kinetic::InstantaneousKernel} in order
to insert/remove geometric primitives and audit to insert/remove geometric primitives and audit
themselves. \ccc{Kinetic::Sort<Traits, Visitor>} uses the sorting themselves. \ccc{Kinetic::Sort<Traits, Visitor>} uses the sorting
functionality in STL instead.} functionality in the {\sc Stl} instead.}
\end{figure} \end{figure}
For simplicity, we added an additional concept, that of For simplicity, we added an additional concept, that of

2
Kinetic_data_structures/doc_tex/Kinetic_data_structures/quick_hints.tex
View File

@ -1,4 +1,4 @@
\subsection{Quick hints \label{sec:quick_hints}} \subsection{Quick Hints \label{sec:quick_hints}}
This section gives quick answers to some questions people might have. This section gives quick answers to some questions people might have.
It presumes knowledge of kinetic data structures and this framework. It presumes knowledge of kinetic data structures and this framework.

2
Kinetic_data_structures/doc_tex/Kinetic_data_structures_ref/intro.tex
View File

@ -7,7 +7,7 @@
Kinetic data structures are a way of adding motion to classical Kinetic data structures are a way of adding motion to classical
geometric data structures. \cgal\ provides several prepackaged kinetic geometric data structures. \cgal\ provides several prepackaged kinetic
data structures. Here we present those kinetic data structures and the data structures. Here we present those kinetic data structures and the
helper classes that allow their activity to monitored. helper classes that allow their activity to be monitored.
\ccHeading{Sorting} \ccHeading{Sorting}