From a6a80f68556c8180977e6af3df5e5d1ab6d7d3db Mon Sep 17 00:00:00 2001 From: Andreas Fabri Date: Wed, 21 Feb 2007 21:27:32 +0000 Subject: [PATCH] fixed typos --- .../doc_tex/Kinetic_data_structures/kds_intro.tex | 2 +- .../doc_tex/Kinetic_data_structures/main.tex | 6 +++--- .../doc_tex/Kinetic_data_structures/overview.tex | 2 +- .../doc_tex/Kinetic_data_structures/quick_hints.tex | 2 +- .../doc_tex/Kinetic_data_structures_ref/intro.tex | 2 +- 5 files changed, 7 insertions(+), 7 deletions(-) diff --git a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/kds_intro.tex b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/kds_intro.tex index c9be3d91e8b..cf0ca6feb4e 100644 --- a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/kds_intro.tex +++ b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/kds_intro.tex @@ -84,7 +84,7 @@ where this equivalence is exploited. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \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}. \item[combinatorial structure] A structure built on top of the primitives. The structure does not depend directly on the diff --git a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/main.tex b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/main.tex index ea38009ecbf..590c187715d 100644 --- a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/main.tex +++ b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/main.tex @@ -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 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 -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 kinetic data structure. The key observation is that the combinatorial 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 sweepline algorithms. This section can be skipped if the reader is already familiar with the area. The next sections, -Section~\ref{sec:kds_terms} and Section~\ref{sec:kds_overview} introduces -the terms and gives an overview of the framework. They are recommended +Section~\ref{sec:kds_terms} and Section~\ref{sec:kds_overview} introduce +the terms and give an overview of the framework. They are recommended reading for all readers, even if you are just using provided kinetic data structures. We then present kinetic data structures for Delaunay triangulations in two and three dimensions in diff --git a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/overview.tex b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/overview.tex index f06be4f19bb..9488892dbb2 100644 --- a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/overview.tex +++ b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/overview.tex @@ -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 to insert/remove geometric primitives and audit themselves. \ccc{Kinetic::Sort} uses the sorting - functionality in STL instead.} + functionality in the {\sc Stl} instead.} \end{figure} For simplicity, we added an additional concept, that of diff --git a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/quick_hints.tex b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/quick_hints.tex index abab4d4c47d..b88b968dd6b 100644 --- a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/quick_hints.tex +++ b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/quick_hints.tex @@ -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. It presumes knowledge of kinetic data structures and this framework. diff --git a/Kinetic_data_structures/doc_tex/Kinetic_data_structures_ref/intro.tex b/Kinetic_data_structures/doc_tex/Kinetic_data_structures_ref/intro.tex index 053f999eaa4..c56135d9fac 100644 --- a/Kinetic_data_structures/doc_tex/Kinetic_data_structures_ref/intro.tex +++ b/Kinetic_data_structures/doc_tex/Kinetic_data_structures_ref/intro.tex @@ -7,7 +7,7 @@ Kinetic data structures are a way of adding motion to classical geometric data structures. \cgal\ provides several prepackaged kinetic 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}