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

Spell check.

This commit is contained in:
Sylvain Pion 2007-04-17 16:14:44 +00:00
parent 3a51d2744c
commit 77f70e18f9
4 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Point_set_2/doc_tex/Point_set_2/PkgDescription.tex
View File

@ -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}}

2
Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbor.tex
View File

@ -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}

6
Point_set_2/doc_tex/Point_set_2_ref/nearest_neighbors.tex
View File

@ -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}

8
Point_set_2/doc_tex/Point_set_2_ref/range_search.tex
View File

@ -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}