#include <CGAL/Orthogonal_incremental_neighbor_search.h>
template<typename Traits, typename
OrthogonalDistance, typename
Splitter, typename
SpatialTree>
class CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >
The class Orthogonal_incremental_neighbor_search implements incremental nearest and furthest neighbor searching on a tree.
- Template Parameters
-
- See also
- CGAL::Incremental_neighbor_search<Traits, GeneralDistance, SpatialTree>
- Examples
- Spatial_searching/distance_browsing.cpp.
|
|
| Orthogonal_incremental_neighbor_search (SpatialTree &tree, Query_item query, FT eps=FT(0.0), bool search_nearest=true, OrthogonalDistance d=OrthogonalDistance()) |
| | Constructor for incremental neighbor searching of the query item query in the points stored tree using a distance d and approximation factor eps.
|
|
|
iterator | begin () const |
| | Returns a const iterator to the approximate nearest or furthest neighbor.
|
|
iterator | end () const |
| | Returns the appropriate past-the-end const iterator.
|
|
std::ostream & | statistics (std::ostream &s) const |
| | Inserts statistics of the search process into the output stream s.
|