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

*** empty log message ***

This commit is contained in:
Andreas Fabri 2003-11-16 21:36:26 +00:00
parent 6e61fa75ae
commit 1a1950514c
4 changed files with 16 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Packages/Spatial_searching/doc_tex/Spatial_searching_ref/K_neighbor_search.tex
View File

@ -74,7 +74,7 @@ Inserts statistics of the search process into the output stream \ccc{s}.
\ccSeeAlso
\ccc{CGAL::Orthogonal_k_neighbor_search<PointTraits, Distance, Splitter, SpatialTree>}.
\ccc{CGAL::Orthogonal_k_neighbor_search<PointTraits, OrthogonalDistance, Splitter, SpatialTree>}.
\end{ccRefClass}

16
Packages/Spatial_searching/doc_tex/Spatial_searching_ref/intro.tex
View File

@ -1,9 +1,8 @@
\chapter{Spatial Searching}
\label{ChapterReferenceSpatialSearching}
The {\bf spatial searching} package implements
exact and approximate distance browsing
by providing implementations of algorithms supporting
This package implements exact and approximate distance browsing by
providing implementations of algorithms supporting
\begin{itemize}
@ -30,16 +29,15 @@ query items representing points and spatial objects.
In these searching problems a set $P$ of data points in $d$-dimensional
space is given.
The spatial searching package
consists of the following concepts and classes
that are described in the reference pages.
The spatial searching package consists of the following concepts and
classes that are described in the reference pages.
\ccHeading{Concepts}
\ccRefConceptPage{Ball_d} \\
\ccRefConceptPage{FuzzyQueryItem} \\
\ccRefConceptPage{GeneralDistance} \\
\ccRefConceptPage{IsoBox_d} \\
\ccRefConceptPage{IsoBox} \\
\ccRefConceptPage{OrthogonalDistance} \\
\ccRefConceptPage{PointContainer} \\
\ccRefConceptPage{QueryItem} \\
@ -58,8 +56,8 @@ that are described in the reference pages.
\ccRefIdfierPage{CGAL::Fuzzy_sphere<PointTraits>} \\
\ccRefIdfierPage{CGAL::Incremental_neighbor_search<PointTraits, GeneralDistance, Splitter, SpatialTree>} \\
\ccRefIdfierPage{CGAL::K_neighbor_search<PointTraits, GeneralDistance, Splitter, SpatialTree>} \\
\ccRefIdfierPage{CGAL::Kd_tree<TreeTraits>} \\
\ccRefIdfierPage{CGAL::Kd_tree_node<TreeTraits>} \\
\ccRefIdfierPage{CGAL::Kd_tree<PointTraits>} \\
\ccRefIdfierPage{CGAL::Kd_tree_node<PointTraits>} \\
\ccRefIdfierPage{CGAL::Kd_tree_rectangle<NT>} \\
\ccRefIdfierPage{CGAL::Kd_tree_traits_point<PointTraits, Splitter>} \\
\ccRefIdfierPage{CGAL::Manhattan_distance_iso_box_point<PointTraits, IsoBox>} \\

2
Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/K_neighbor_search.tex
View File

@ -74,7 +74,7 @@ Inserts statistics of the search process into the output stream \ccc{s}.
\ccSeeAlso
\ccc{CGAL::Orthogonal_k_neighbor_search<PointTraits, Distance, Splitter, SpatialTree>}.
\ccc{CGAL::Orthogonal_k_neighbor_search<PointTraits, OrthogonalDistance, Splitter, SpatialTree>}.
\end{ccRefClass}

16
Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/intro.tex
View File

@ -1,9 +1,8 @@
\chapter{Spatial Searching}
\label{ChapterReferenceSpatialSearching}
The {\bf spatial searching} package implements
exact and approximate distance browsing
by providing implementations of algorithms supporting
This package implements exact and approximate distance browsing by
providing implementations of algorithms supporting
\begin{itemize}
@ -30,16 +29,15 @@ query items representing points and spatial objects.
In these searching problems a set $P$ of data points in $d$-dimensional
space is given.
The spatial searching package
consists of the following concepts and classes
that are described in the reference pages.
The spatial searching package consists of the following concepts and
classes that are described in the reference pages.
\ccHeading{Concepts}
\ccRefConceptPage{Ball_d} \\
\ccRefConceptPage{FuzzyQueryItem} \\
\ccRefConceptPage{GeneralDistance} \\
\ccRefConceptPage{IsoBox_d} \\
\ccRefConceptPage{IsoBox} \\
\ccRefConceptPage{OrthogonalDistance} \\
\ccRefConceptPage{PointContainer} \\
\ccRefConceptPage{QueryItem} \\
@ -58,8 +56,8 @@ that are described in the reference pages.
\ccRefIdfierPage{CGAL::Fuzzy_sphere<PointTraits>} \\
\ccRefIdfierPage{CGAL::Incremental_neighbor_search<PointTraits, GeneralDistance, Splitter, SpatialTree>} \\
\ccRefIdfierPage{CGAL::K_neighbor_search<PointTraits, GeneralDistance, Splitter, SpatialTree>} \\
\ccRefIdfierPage{CGAL::Kd_tree<TreeTraits>} \\
\ccRefIdfierPage{CGAL::Kd_tree_node<TreeTraits>} \\
\ccRefIdfierPage{CGAL::Kd_tree<PointTraits>} \\
\ccRefIdfierPage{CGAL::Kd_tree_node<PointTraits>} \\
\ccRefIdfierPage{CGAL::Kd_tree_rectangle<NT>} \\
\ccRefIdfierPage{CGAL::Kd_tree_traits_point<PointTraits, Splitter>} \\
\ccRefIdfierPage{CGAL::Manhattan_distance_iso_box_point<PointTraits, IsoBox>} \\