CGAL 4.7 - dD Spatial Searching: Search Classes

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - dD Spatial Searching

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Search Classes
dD Spatial Searching Reference

##

## Classes

class | CGAL::Incremental_neighbor_search< Traits, GeneralDistance, Splitter, SpatialTree >
| The class `Incremental_neighbor_search` implements incremental nearest and furthest neighbor searching on a tree. More...
class | CGAL::K_neighbor_search< Traits, GeneralDistance, Splitter, SpatialTree >
| The class `K_neighbor_search` implements approximate `k`-nearest and `k`-furthest neighbor searching using standard search on a tree using a general distance class. More...
class | CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
| The class `Kd_tree` defines a `k-d` tree. More...
class | CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >
| The class `Orthogonal_incremental_neighbor_search` implements incremental nearest and furthest neighbor searching on a tree. More...
class | CGAL::Orthogonal_k_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >
| The class `Orthogonal_k_neighbor_search` implements approximate`k`-nearest and `k`-furthest neighbor searching on a tree using an orthogonal distance class. More...