mirror of https://github.com/CGAL/cgal
81 lines
2.2 KiB
TeX
Executable File
81 lines
2.2 KiB
TeX
Executable File
\chapter{Approximate Spatial Searching}
|
|
|
|
\section{Introduction}
|
|
|
|
|
|
The {\bf approximate spatial searching} package implements
|
|
exact and approximate distance browsing
|
|
by providing implementations of algorithms supporting
|
|
|
|
\begin{itemize}
|
|
|
|
\item
|
|
both nearest and furthest neighbour searching
|
|
|
|
\item
|
|
both exact and approximate searching
|
|
|
|
\item
|
|
(approximate) $k$-nearest and $k$-furthest neighbour searching
|
|
|
|
\item
|
|
(approximate) incremental nearest and incremental furthest neighbour 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 approximate spatial searching package
|
|
consists of the following concepts, function object concepts, classes, function object classes
|
|
and enumerations that are described in the reference pages.
|
|
|
|
{\bf Concepts}
|
|
|
|
GeneralDistance \ccOpenAngle QueryItem, Item\ccCloseAngle \\
|
|
OrthogonalDistance \ccOpenAngle QueryItem, Item\ccCloseAngle \\
|
|
QueryItem \\
|
|
Separator \ccOpenAngle NT\ccCloseAngle \\
|
|
TreeTraits \ccOpenAngle Separator, Item\ccCloseAngle
|
|
|
|
{\bf Function object concepts}
|
|
|
|
SplitRule \ccOpenAngle Item\ccCloseAngle
|
|
|
|
{\bf Classes}
|
|
|
|
\ccc{General_priority_search<Traits,QueryItem,Distance>} \\
|
|
\ccc{General_priority_search<Traits,QueryItem,Distance>::iterator} \\
|
|
\ccc{General_standard_search<Traits,QueryItem,Distance>} \\
|
|
\ccc{Kd_tree<Traits>} \\
|
|
\ccc{Kd_tree_node<Traits>} \\
|
|
\ccc{Kd_tree_rectangle<NT>} \\
|
|
\ccc{Kd_tree_traits_point<Separator,Item>} \\
|
|
\ccc{L1_distance_rectangle_point<QueryItem,Item>} \\
|
|
\ccc{Point_container<Item>} \\
|
|
\ccc{Plane_separator<NT>} \\
|
|
\ccc{Orthogonal_priority_search<Traits,QueryItem,Distance>} \\
|
|
\ccc{Orthogonal_priority_search<Traits,QueryItem,Distance>::iterator} \\
|
|
\ccc{Orthogonal_standard_search<Traits,QueryItem,Distance>} \\
|
|
\ccc{Weighted_Minkowski_distance<QueryItem,Item>}
|
|
|
|
{\bf Function object classes}
|
|
|
|
\ccc{Fair<Item>} \\
|
|
\ccc{Median_of_rectangle<Item>} \\
|
|
\ccc{Median_of_max_spread<Item>} \\
|
|
\ccc{Midpoint_of_rectangle<Item>} \\
|
|
\ccc{Midpoint_of_max_spread<Item>} \\
|
|
\ccc{Sliding_fair<Item>} \\
|
|
\ccc{Sliding_midpoint<Item>}
|
|
|
|
|
|
{\bf Enumerations}
|
|
|
|
\ccc{Split_rule_enumeration::Split_rule}
|
|
|
|
|
|
|