## CGAL::Search_traits_d<Kernel>

### Definition

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>

### Parameters

Expects for the template argument a model of the concept Kernel_d, for example CGAL::Cartesian_d<double> or CGAL::Homogeneous_d<CGAL::Gmp_z>.

### Is Model for the Concept

SearchTraits.

### Types

Kernel::FT | NT; | Number type.
Kernel::Point_d | Point_d; | Point type.
Kernel::Iso_cuboid_d
| Iso_box_d; | Iso box type.
Kernel::Sphere_d | Sphere_d; | Sphere type.
Kernel::Cartesian_const_iterator_d
| Cartesian_const_iterator;
|  | An iterator over the Cartesian coordinates.
Kernel::Construct_cartesian_const_iterator_d
| Construct_cartesian_const_iterator;
|  | 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.
Kernel::Construct_min_vertex_d
| Construct_min_vertex_d;
|  | Functor with operator to construct the vertex with lexicographically smallest coordinates of an object of type Iso_box_d.
Kernel::Construct_max_vertex_d
| Construct_max_vertex_d;
|  | Functor with operator to construct the vertex with lexicographically largest coordinates of an object of type Iso_box_d.

### See Also

Search_traits_2<Kernel>
Search_traits_3<Kernel>
Search_traits<Point,CartesianConstIterator,ConstructCartesianConstIterator>