trying to clean up from the corruption

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
+  primitives. The structure does not depend directly on the
-of the primitives, only on relationships between them.
+  coordinates of the primitives, only on relationships between them.
-\item[trajectory] The path traced out by a primitive as time
+\item[trajectory] The path traced out by a primitive as time passes.
-passes. In other words how the coordinates of a primitive change with
+  In other words how the coordinates of a primitive change with time.
-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
+  primitives from a snapshot as input and produces one of a discrete
-outputs.
+  set of outputs.
 \item[certificate] One of a set of predicates which, when all having
-the correct values, ensure that the combinatorial structure is
+  the correct values, ensure that the combinatorial structure is
-correct.
+  correct.
 \item[certificate function] A function of time which is positive when
-the corresponding certificate has the correct value. Then the
+  the corresponding certificate has the correct value. When the
-certificate function changes sign, the combinatorial structure needs
+  certificate function changes sign, the combinatorial structure needs
-to be updated.
+  to be updated.
 \item[event] When a certificate function changes sign and the
-combinatorial structure needs to be updated.
+  combinatorial structure needs to be updated.
-\item[static] Having to do with geometric data structures on non-moving primitives.
 \end{description}
 
 

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<Traits, Visitor>}] maintain a list of points
 sorted by x-coordinate.
-\item[\ccc{Kinetic::Delaunay_triangulation_2<Traits,Visitor,
+\item[\ccc{Kinetic::Delaunay_triangulation_2<Traits, Visitor,
-Triangulation>},\ccc{Kinetic::Delaunay_triangulation_3<Traits,Visitor,
+    Triangulation>}] maintain the Delaunay triangulation of a set of
-Triangulation>}] maintain the Delaunay triangulation of a set of two
+  two dimensional points
-or three dimensional points.
+\item[\ccc{Kinetic::Delaunay_triangulation_3<Traits,Visitor,
+    Triangulation>}] maintain the Delaunay triangulation of a set of
+  three dimensional points.
 \item[\ccc{Kinetic::Regular_triangulation_3<Traits, Visitor,
 Triangulation}>] maintain the regular triangulation of a set of waiting
 three dimensional points.
 \item[\ccc{Kinetic::Enclosing_box_2<Traits>},
-\ccc{Kinetic::Enclosing_box_3<Traits>}] restrict points to stay within
+  \ccc{Kinetic::Enclosing_box_3<Traits>}] restrict points to stay
-a box by bouncing them off the walls.
+  within a box by bouncing them off the walls.
 \end{description}
 
 

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: