The class Orthogonal_k_neighbor_search<Traits, OrthogonalDistance, Splitter, SpatialTree> implements approximate -nearest and -furthest neighbor searching on a tree using an orthogonal distance class.
#include <CGAL/Orthogonal_k_neighbor_search.h>
Expects for the first template argument an implementation of the concept SearchTraits, for example CGAL::Search_traits_2<CGAL::Cartesian<double> >.
Expects for the second template argument a model of the concept GeneralDistance. The default type is CGAL::Euclidean_distance<Traits>.
Expects for third template argument a model of the concept Splitter. The default type is CGAL::Sliding_midpoint<Traits>.
Expects for fourth template argument an implementation of the concept SpatialTree. The default type is CGAL::Kd_tree<Traits, Splitter, CGAL::Tag_true>. The template argument must be CGAL::Tag_true because orthogonal search needs extended kd tree nodes.
|
| Point type. |
|
| Number type. |
|
| Query item. |
|
| Pair of point and transformed distance. |
| |
Bidirectional iterator with value type Point_with_transformed_distance
for enumerating approximate neighbors.
|
|
| The tree type. |
| |||||
Constructor for searching approximately neighbors of the query item query
in the points stored in tree using
distance d and approximation factor eps.
|
|
| Returns an iterator to the approximate neighbors. |
|
| Past-the-end iterator. |
advanced |
|
| Inserts statistics of the search process into the output stream s. |
advanced |
CGAL::K_neighbor_search<Traits, GeneralDistance, Splitter, SpatialTree>.