The class Search_traits_d<Kernel> can be used as a template parameter of the kd tree and the search classes. Kernel must be a Cgal kernel.
Kernel must be a d-dimensional Cgal kernel.
#include <CGAL/Search_traits_d.h>
|
| Number type. |
|
| Point type. |
|
| Iso box type. |
|
| Sphere type. |
| ||
| An iterator over the Cartesian coordinates. | |
| ||
| ||
A functor with two function operators, which return the begin and past the end iterator for the Cartesian coordinates. The functor for begin has as argument a Point_d. The functor for the past the end iterator, has as argument a Point_d and an int. | ||
|
| Functor with operator to construct the vertex with lexicographically smallest coordinates of an object of type Iso_box_d. |
|
| Functor with operator to construct the vertex with lexicographically largest coordinates of an object of type Iso_box_d. |
Search_traits_2<Kernel>
Search_traits_3<Kernel>
Search_traits<Point,CartesianConstIterator,ConstructCartesianConstIterator>