mirror of https://github.com/CGAL/cgal
85 lines
2.0 KiB
TeX
Executable File
85 lines
2.0 KiB
TeX
Executable File
\chapter{Spatial Searching}
|
|
|
|
\section{Introduction}
|
|
|
|
The {\bf spatial searching} package implements
|
|
exact and approximate distance browsing
|
|
by providing implementations of algorithms supporting
|
|
|
|
\begin{itemize}
|
|
|
|
\item
|
|
both nearest and furthest neighbor searching
|
|
|
|
\item
|
|
both exact and approximate searching
|
|
|
|
\item
|
|
(approximate) range searching
|
|
|
|
\item
|
|
(approximate) $k$-nearest and $k$-furthest neighbor searching
|
|
|
|
\item
|
|
(approximate) incremental nearest and incremental furthest neighbor searching
|
|
|
|
\item
|
|
query items representing points and spatial objects.
|
|
|
|
\end{itemize}
|
|
|
|
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.
|
|
|
|
{\bf Concepts}
|
|
|
|
Container \\
|
|
GeneralDistance \\
|
|
FuzzyQueryItem \\
|
|
IsoBox\_d \\
|
|
OrthogonalDistance \\
|
|
Point \\
|
|
QueryItem \\
|
|
Separator \\
|
|
Splitter \\
|
|
Traits \\
|
|
TreeTraits
|
|
|
|
{\bf Classes}
|
|
|
|
\ccc{Euclidean_distance<Point>} \\
|
|
\ccc{Euclidean_distance_sphere_point<QueryItem,Point>} \\
|
|
\ccc{Fair<Point,Container,Separator>} \\
|
|
\ccc{Fuzzy_iso_box<Point,IsoBox_d>} \\
|
|
\ccc{Fuzzy_sphere_d<Point>} \\
|
|
\ccc{General_priority_search<TreeTraits,Distance,QueryItem,Tree>} \\
|
|
\ccc{General_standard_search<TreeTraits,Distance,QueryItem,Tree>} \\
|
|
\ccc{Kd_tree<TreeTraits>} \\
|
|
\ccc{Kd_tree_node<TreeTraits>} \\
|
|
\ccc{Kd_tree_rectangle<NT>} \\
|
|
\ccc{Kd_tree_traits_point<Point,Splitter>} \\
|
|
\ccc{Manhattan_distance_rectangle_point<QueryItem,Point>} \\
|
|
\ccc{Median_of_rectangle<Point,Container,Separator>} \\
|
|
\ccc{Median_of_max_spread<Point,Container,Separator>} \\
|
|
\ccc{Midpoint_of_rectangle<Point,Container,Separator>} \\
|
|
\ccc{Midpoint_of_max_spread<Point,Container,Separator>} \\
|
|
\ccc{Orthogonal_priority_search<TreeTraits,Distance,Tree>} \\
|
|
\ccc{Orthogonal_standard_search<TreeTraits,Distance,Tree>} \\
|
|
\ccc{Plane_separator<NT>} \\
|
|
\ccc{Point_container<Point>} \\
|
|
\ccc{Sliding_fair<Point,Container,Separator>} \\
|
|
\ccc{Sliding_midpoint<Point,Container,Separator>} \\
|
|
\ccc{Weighted_Minkowski_distance<Point>}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|