mirror of https://github.com/CGAL/cgal
88 lines
3.1 KiB
TeX
Executable File
88 lines
3.1 KiB
TeX
Executable File
\chapter{Spatial Searching}
|
|
|
|
The 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.
|
|
|
|
\ccHeading{Concepts}
|
|
|
|
|
|
\ccRefConceptPage{FuzzyQueryItem} \\
|
|
\ccRefConceptPage{GeneralDistance} \\
|
|
\ccRefConceptPage{IsoBox_d} \\
|
|
\ccRefConceptPage{OrthogonalDistance} \\
|
|
\ccRefConceptPage{PointContainer} \\
|
|
\ccRefConceptPage{PointTraits} \\
|
|
\ccRefConceptPage{QueryItem} \\
|
|
\ccRefConceptPage{SpatialSeparator} \\
|
|
\ccRefConceptPage{SpatialTree} \\
|
|
\ccRefConceptPage{Splitter} \\
|
|
\ccRefConceptPage{TreeTraits} \\
|
|
|
|
\ccHeading{Classes}
|
|
|
|
\ccRefIdfierPage{CGAL::Euclidean_distance<PointTraits>} \\
|
|
\ccRefIdfierPage{CGAL::Euclidean_distance_sphere_point<PointTraits, QueryItem>} \\
|
|
\ccRefIdfierPage{CGAL::Fair<PointTraits, PointContainer, SpatialSeparator>} \\
|
|
\ccRefIdfierPage{CGAL::Fuzzy_iso_box<PointTraits, IsoBox_d>} \\
|
|
\ccRefIdfierPage{CGAL::Fuzzy_sphere<PointTraits>} \\
|
|
\ccRefIdfierPage{CGAL::General_priority_search<PointTraits, GeneralDistance, QueryItem, SpatialTree>} \\
|
|
\ccRefIdfierPage{CGAL::General_standard_search<PointTraits, GeneralDistance, QueryItem, SpatialTree>} \\
|
|
\ccRefIdfierPage{CGAL::Kd_tree<PointTraits, Splitter>} \\
|
|
\ccRefIdfierPage{CGAL::Kd_tree_node<PointTraits>} \\
|
|
\ccRefIdfierPage{CGAL::Kd_tree_rectangle<NT>} \\
|
|
\ccRefIdfierPage{CGAL::Kd_tree_traits_point_2<Kernel>} \\
|
|
\ccRefIdfierPage{CGAL::Kd_tree_traits_point_3<Kernel>} \\
|
|
\ccRefIdfierPage{CGAL::Kd_tree_traits_point_d<Kernel>} \\
|
|
\ccRefIdfierPage{CGAL::Manhattan_distance_rectangle_point<QueryItem, PointTraits>} \\
|
|
\ccRefIdfierPage{CGAL::Median_of_max_spread<PointTraits, PointContainer, SpatialSeparator>} \\
|
|
\ccRefIdfierPage{CGAL::Median_of_rectangle<PointTraits, PointContainer, SpatialSeparator>} \\
|
|
\ccRefIdfierPage{CGAL::Midpoint_of_max_spread<PointTraits, PointContainer, SpatialSeparator>} \\
|
|
\ccRefIdfierPage{CGAL::Midpoint_of_rectangle<PointTraits, PointContainer, SpatialSeparator>} \\
|
|
\ccRefIdfierPage{CGAL::Orthogonal_priority_search<PointTraits, OrthogonalDistance, SpatialTree>} \\
|
|
\ccRefIdfierPage{CGAL::Orthogonal_standard_search<PointTraits, OrthogonalDistance, SpatialTree>} \\
|
|
\ccRefIdfierPage{CGAL::Plane_separator<NT>} \\
|
|
\ccRefIdfierPage{CGAL::Point_container<PointTraits>} \\
|
|
\ccRefIdfierPage{CGAL::Sliding_fair<PointTraits, PointContainer, SpatialSeparator>} \\
|
|
\ccRefIdfierPage{CGAL::Sliding_midpoint<PointTraits, PointContainer, SpatialSeparator>} \\
|
|
\ccRefIdfierPage{CGAL::Weighted_Minkowski_distance<PointTraits>} \\
|
|
|
|
\lcHtml{\ccHeading{Alphabetical Listing of Reference Pages}}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|