Hans Tangelder and Andreas Fabri
This package implements exact and approximate distance browsing by providing exact and approximate algorithms for range searching, k-nearest and k-furthest neighbor searching, as well as incremental nearest and incremental furthest neighbor searching, where the query items are points in dD Euclidean space.
This package provides data structures and algorithms for exact and approximate distance browsing, supporting
- both nearest and furthest neighbor searching,
- both exact and approximate searching,
- (approximate) range searching,
- (approximate) k-nearest and k-furthest neighbor searching,
- (approximate) incremental nearest and incremental furthest neighbor searching,
- query items representing points and spatial objects.
The spatial searching package consists of the following concepts and classes that are described in the reference pages.
Search Classes
- CGAL::K_neighbor_search<Traits, GeneralDistance, Splitter, SpatialTree>
- CGAL::Incremental_neighbor_search<Traits, GeneralDistance, Splitter, SpatialTree>
- CGAL::Orthogonal_incremental_neighbor_search<Traits, OrthogonalDistance, Splitter, SpatialTree>
- CGAL::Orthogonal_k_neighbor_search<Traits, OrthogonalDistance, Splitter, SpatialTree>
- CGAL::Kd_tree<Traits, Splitter, UseExtendedNode>
Range Query Item Classes
Search Traits Classes
Distance Classes
Splitter Classes
Advanced Classes
Concepts