CGAL::Search_traits_d< Kernel > Class Template Reference

#include <CGAL/Search_traits_d.h>

Definition

The class Search_traits_d 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.

Parameters

Expects for the template argument a model of the concept Kernel_d, for example Cartesian_d<double>.

Is Model Of:

SearchTraits

RangeSearchTraits

See Also

Search_traits_2<Kernel>

Search_traits_3<Kernel>

Search_traits<Point,CartesianConstIterator,ConstructCartesianConstIterator>

Examples:

Spatial_searching/fuzzy_range_query.cpp.

Types
typedef Kernel::FT	NT
	Number type.
typedef Kernel::Point_d	Point_d
	Point type.
typedef Kernel::Iso_box_d	Iso_box_d
	Iso box type.
typedef Kernel::Sphere_d	Sphere_d
	Sphere type.
typedef Kernel::Cartesian_const_iterator_d	Cartesian_const_iterator
	An iterator over the Cartesian coordinates.
typedef 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. More...
typedef 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.
typedef 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.

Member Typedef Documentation

template<typename Kernel >

typedef Kernel::Construct_cartesian_const_iterator_d CGAL::Search_traits_d< Kernel >::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.