#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.
|
iterator | begin () const |
| Returns a const iterator to the approximate nearest or furthest neighbor. More...
|
|
iterator | end () const |
| Returns the appropriate past-the-end const iterator. More...
|
|
std::ostream & | statistics (std::ostream &s) const |
| Inserts statistics of the search process into the output stream s . More...
|
|
◆ Distance
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
◆ FT
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
◆ iterator
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
const input iterator with value type Point_with_transformed_distance
for enumerating approximate neighbors.
◆ Point_d
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
◆ Point_with_transformed_distance
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
Pair of point and transformed distance.
◆ Query_item
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
◆ Tree
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
◆ Orthogonal_incremental_neighbor_search()
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
Constructor for incremental neighbor searching of the query item query
in the points stored tree
using a distance d
and approximation factor eps
.
◆ begin()
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
Returns a const iterator to the approximate nearest or furthest neighbor.
◆ end()
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
Returns the appropriate past-the-end const iterator.
◆ statistics()
template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
Inserts statistics of the search process into the output stream s
.