CGAL 4.5.1 - dD Spatial Searching
|
This package provides data structures and algorithms for exact and approximate distance browsing, supporting
k
-nearest and k
-furthest neighbor searching,The spatial searching package consists of the following concepts and classes that are described in the reference pages.
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>
CGAL::Fuzzy_iso_box<Traits>
CGAL::Fuzzy_sphere<Traits>
CGAL::Search_traits_2<Kernel>
CGAL::Search_traits_3<Kernel>
CGAL::Search_traits_d<Kernel>
CGAL::Search_traits<NT,Point,CartesianIterator,ConstructCartesianIterator,ConstructMinVertex,ConstructMaxVertex>
CGAL::Search_traits_adapter<Key,PointPropertyMap,BaseTraits>
CGAL::Euclidean_distance<Traits>
CGAL::Euclidean_distance_sphere_point<Traits>
CGAL::Manhattan_distance_iso_box_point<Traits>
CGAL::Weighted_Minkowski_distance<Traits>
CGAL::Distance_adapter<Key,PointPropertyMap,Base_distance>
CGAL::Sliding_midpoint<Traits, SpatialSeparator>
CGAL::Sliding_fair<Traits, SpatialSeparator>
CGAL::Fair<Traits, SpatialSeparator>
CGAL::Median_of_max_spread<Traits, SpatialSeparator>
CGAL::Median_of_rectangle<Traits, SpatialSeparator>
CGAL::Midpoint_of_max_spread<Traits, SpatialSeparator>
CGAL::Midpoint_of_rectangle<Traits, SpatialSeparator>
CGAL::Kd_tree_node<Traits, Splitter, UseExtendedNode>
CGAL::Kd_tree_rectangle<FT>
CGAL::Plane_separator<FT>
CGAL::Point_container<Traits>
FuzzyQueryItem
GeneralDistance
OrthogonalDistance
SearchTraits
RangeSearchTraits
SpatialSeparator
SpatialTree
Splitter
Modules | |
Concepts | |
Search Classes | |
Range Query Item Classes | |
Search Traits Classes | |
Distance Classes | |
Splitter Classes | |
Advanced Classes | |