From 77f70e18f9b0038c19729b7a93e03bf55d47d5de Mon Sep 17 00:00:00 2001 From: Sylvain Pion Date: Tue, 17 Apr 2007 16:14:44 +0000 Subject: [PATCH] Spell check. --- Point_set_2/doc_tex/Point_set_2/PkgDescription.tex | 2 +- Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbor.tex | 2 +- Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbors.tex | 6 +++--- Point_set_2/doc_tex/Point_set_2_ref/range_search.tex | 8 ++++---- 4 files changed, 9 insertions(+), 9 deletions(-) diff --git a/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex b/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex index 685561149e3..b3d56ee781e 100644 --- a/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex +++ b/Point_set_2/doc_tex/Point_set_2/PkgDescription.tex @@ -4,7 +4,7 @@ \ccPkgSummary{ This package supports circular, triangular, and isorectangular range search queries as well as (k) nearest neighbor search queries on 2D point sets. -In contrast to thes spatial searching package, this package uses a +In contrast to the spatial searching package, this package uses a Delaunay triangulation as underlying data structure.} \ccPkgDependsOn{\ccRef[2D Delaunay triangulation]{Pkg:Triangulation2}} diff --git a/Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbor.tex b/Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbor.tex index ef4a4386c75..cd4d5f2ae34 100644 --- a/Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbor.tex +++ b/Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbor.tex @@ -16,7 +16,7 @@ If $v$ is the only vertex in $delau$ , $NULL$ is returned. } \ccHeading{Requirements} -\ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept PointSetTraits and from +\ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept \ccc{PointSetTraits} and from the Delaunay triangulation data type: \begin{itemize} \item \ccc{Dt::Geom_traits} diff --git a/Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbors.tex b/Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbors.tex index bd25f26bb45..0719fb54fc6 100644 --- a/Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbors.tex +++ b/Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbors.tex @@ -5,7 +5,7 @@ The function \ccRefName\ is the function template version of the k nearest neighbors search on Delaunay triangulations. There are two versions of -this function, one taking a point of the Delanay triangulation and the +this function, one taking a point of the Delaunay triangulation and the other taking a vertex handle. \ccInclude{CGAL/nearest_neighbor_delaunay_2.h} @@ -20,7 +20,7 @@ returns an output iterator pointing to the position beyond the end of the sequence. } \ccHeading{Requirements} -\ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept PointSetTraits and from +\ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept \ccc{PointSetTraits} and from the Delaunay triangulation data type: \begin{itemize} \item \ccc{Dt::Geom_traits} @@ -45,7 +45,7 @@ returns an output iterator pointing to the position beyond the end of the sequence. } \ccHeading{Requirements} -\ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept PointSetTraits and from +\ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept \ccc{PointSetTraits} and from the Delaunay triangulation data type: \begin{itemize} \item \ccc{Dt::Geom_traits} diff --git a/Point_set_2/doc_tex/Point_set_2_ref/range_search.tex b/Point_set_2/doc_tex/Point_set_2_ref/range_search.tex index 96ba70fdd77..2a0dd77484d 100644 --- a/Point_set_2/doc_tex/Point_set_2_ref/range_search.tex +++ b/Point_set_2/doc_tex/Point_set_2_ref/range_search.tex @@ -6,7 +6,7 @@ There are six versions of the function template \ccRefName\ that perform range searches on Delaunay triangulations. The first performs circular range searches, the second triangular range searches and the third performs iso-rectangular range searches. The other three range search -function templates perform enhanced variants of the three beforementioned +function templates perform enhanced variants of the three aforementioned operations.\\ They get a user-defined object that has to control the range search operation. This way one can for instance stop the search, when $n$ points were found. @@ -25,7 +25,7 @@ $delau$ is the \cgal\ Delaunay triangulation on which we perform the range searc \ccHeading{Requirements} \begin{itemize} -\item \ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept PointSetTraits and from +\item \ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept \ccc{PointSetTraits} and from the Delaunay triangulation data type: \begin{itemize} \item \ccc{Dt::Geom_traits} @@ -53,7 +53,7 @@ of the sequence. $delau$ is the \cgal\ Delaunay triangulation on which we perform the range search operation.} \ccHeading{Requirements} -\ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept PointSetTraits and from +\ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept \ccc{PointSetTraits} and from the Delaunay triangulation data type: \begin{itemize} \item \ccc{Dt::Geom_traits} @@ -82,7 +82,7 @@ returns an output iterator pointing to the position beyond the end of the sequence. $delau$ is the \cgal\ Delaunay triangulation on which we perform the range search operation.} \ccHeading{Requirements} -\ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept PointSetTraits and from +\ccc{Dt} is a \cgal\ Delaunay triangulation and contains the following subset of types from the concept \ccc{PointSetTraits} and from the Delaunay triangulation data type: \begin{itemize} \item \ccc{Dt::Geom_traits}