From 200a5fd9b46ae48cee580b16b51ebe217419a1c1 Mon Sep 17 00:00:00 2001 From: Daniel Russel Date: Sat, 11 Mar 2006 21:45:02 +0000 Subject: [PATCH] trying to clean up from the corruption --- .../doc_tex/Kinetic_data_structures/main.tex | 32 +++++++++---------- .../Kinetic_data_structures/provided_kdss.tex | 14 ++++---- .../Kinetic_data_structures/sort_example.tex | 2 +- 3 files changed, 25 insertions(+), 23 deletions(-) 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 5c0819fff4c..c59d2254ec4 100644 --- a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/main.tex +++ b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/main.tex @@ -133,28 +133,28 @@ where this equivalence is exploited. \begin{description} \item[primitive] The basic geometric types--i.e.\ 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 -primitives. The structure does not depend directly on the coordinates -of the primitives, only on relationships between them. -\item[trajectory] The path traced out by a primitive as time -passes. In other words how the coordinates of a primitive change with -time. + primitives. The structure does not depend directly on the + coordinates of the primitives, only on relationships between them. +\item[trajectory] The path traced out by a primitive as time passes. + In other words how the coordinates of a primitive change with time. \item[snapshot] The position of all the primitives at a particular -moment in time. + moment in time. +\item[static] Having to do with geometric data structures on + non-moving primitives. \item[predicate] A function which takes the coordinates of several -primitives from a snapshot as input and produces a discrete set of -outputs. + primitives from a snapshot as input and produces one of a discrete + set of outputs. \item[certificate] One of a set of predicates which, when all having -the correct values, ensure that the combinatorial structure is -correct. + the correct values, ensure that the combinatorial structure is + correct. \item[certificate function] A function of time which is positive when -the corresponding certificate has the correct value. Then the -certificate function changes sign, the combinatorial structure needs -to be updated. + the corresponding certificate has the correct value. When the + certificate function changes sign, the combinatorial structure needs + to be updated. \item[event] When a certificate function changes sign and the -combinatorial structure needs to be updated. -\item[static] Having to do with geometric data structures on non-moving primitives. + combinatorial structure needs to be updated. \end{description} diff --git a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/provided_kdss.tex b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/provided_kdss.tex index 7a64e17fd5a..95abddbf291 100644 --- a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/provided_kdss.tex +++ b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/provided_kdss.tex @@ -5,16 +5,18 @@ Along with the framework, we provide several already implemented kinetic data st \begin{description} \item[\ccc{Kinetic::Sort}] maintain a list of points sorted by x-coordinate. -\item[\ccc{Kinetic::Delaunay_triangulation_2},\ccc{Kinetic::Delaunay_triangulation_3}] maintain the Delaunay triangulation of a set of two -or three dimensional points. +\item[\ccc{Kinetic::Delaunay_triangulation_2}] maintain the Delaunay triangulation of a set of + two dimensional points +\item[\ccc{Kinetic::Delaunay_triangulation_3}] maintain the Delaunay triangulation of a set of + three dimensional points. \item[\ccc{Kinetic::Regular_triangulation_3] maintain the regular triangulation of a set of waiting three dimensional points. \item[\ccc{Kinetic::Enclosing_box_2}, -\ccc{Kinetic::Enclosing_box_3}] restrict points to stay within -a box by bouncing them off the walls. + \ccc{Kinetic::Enclosing_box_3}] restrict points to stay + within a box by bouncing them off the walls. \end{description} diff --git a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/sort_example.tex b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/sort_example.tex index 5908ad466e2..c4d9063c712 100644 --- a/Kinetic_data_structures/doc_tex/Kinetic_data_structures/sort_example.tex +++ b/Kinetic_data_structures/doc_tex/Kinetic_data_structures/sort_example.tex @@ -1,4 +1,4 @@ -\subsection{Two Dimensional Delaunay} +\subsection{Using a provided kinetic data structure} \label{sec:sort_example} Using a kinetic data structure can be as simple as the following: