The class Search_traits_adapter<Key,PointPropertyMap,BaseTraits> can be used as a template parameter of the kd tree and the search classes. When using this traits class in a nearest neighbor search algorithm, the class Distance_for_point_adapter<Key,PointPropertyMap,Base_distance> must be used as distance.
#include <CGAL/Search_traits_adapter.h>
SearchTraits if BaseTraits is a model of SearchTraits.
RangeSearchTraits if BaseTraits is a model of RangeSearchTraits.
Key | Point_d; | |
BaseTraits::FT | FT; | |
BaseTraits::Cartesian_const_iterator_d | ||
Cartesian_const_iterator_d; | ||
BaseTraits | Base; |
Search_traits_adapter<Key,PointPropertyMap,BaseTraits> t ( PointPropertyMap ppmap=PointPropertyMap(), BaseTraits base=BaseTraits()); | |
Constructor initializing the class to base and setting the point property map of the class to ppmap.
|
PointPropertyMap | t.point_property_map () const | Returns the point property map. |
Distance_for_point_adapter<Key,PointPropertyMap,Base_distance>
Search_traits_2<Kernel>
Search_traits_3<Kernel>
Search_traits_d<Kernel>
Search_traits<Point,CartesianConstIterator,ConstructCartesianConstIterator