|
The class Incremental_neighbor_search<Traits, GeneralDistance, Splitter, SpatialTree> implements incremental nearest and furthest neighbor searching on a tree. The tree may have extended or unextended nodes.
#include <CGAL/Incremental_neighbor_search.h>
Expects for the first template argument a model 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 a model of the concept SpatialTree. The default type is CGAL::Kd_tree<Traits,Splitter,CGAL::Tag_false>. The template argument CGAL::Tag_false makes that the tree is built with unextended nodes.
|
|
| Point type. |
|
|
| Number type. |
|
|
| Pair of point and transformed distance. |
|
| |
|
Input iterator with value type Point_with_transformed_distance
for enumerating approximate neighbors.
| |
|
|
| Query item type. |
|
|
| The tree type. |
| |||||
|
Constructor for incremental neighbor searching of the query item q
in the points stored tree using a distance d and approximation factor eps.
| |||||
|
|
| Returns an iterator to the approximate nearest or furthest neighbor. |
|
|
| Past-the-end iterator. |
|
|
| Inserts statistics of the search process into the output stream s. |
CGAL::Orthogonal_incremental_neighbor_search<Traits, OrthogonalDistance, Splitter, SpatialTree>.