\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.7 - dD Spatial Searching
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree > Class Template Reference

#include <CGAL/Orthogonal_incremental_neighbor_search.h>

Definition

The class Orthogonal_incremental_neighbor_search implements incremental nearest and furthest neighbor searching on a tree.

Template Parameters
Traitsmust be a model of the concept SearchTraits, for example Search_traits_2<Simple_cartesian<double> >.
OrthogonalDistancemust be a model of the concept OrthogonalDistance. If Traits is Search_traits_adapter<Key,PointPropertyMap,BaseTraits> the default type is Distance_adapter<Key,PointPropertyMap,Euclidean_distance<BaseTraits> >, and Euclidean_distance<Traits> otherwise.
Splittermust be a model of the concept Splitter. The default type is Sliding_midpoint<Traits>.
SpatialTreemust be a model of the concept SpatialTree. The default type is Kd_tree<Traits, Splitter, Tag_true>. The template argument must be Tag_true because orthogonal search needs extended kd tree nodes.
See also
CGAL::Incremental_neighbor_search<Traits, GeneralDistance, SpatialTree>
Examples:
Spatial_searching/distance_browsing.cpp.

Types

typedef Traits::Point_d Point_d
 Point type. More...
 
typedef Traits::FT FT
 Number type. More...
 
typedef OrthogonalDistance Distance
 Distance type. More...
 
typedef
OrthogonalDistance::Query_item 
Query_item
 Query item. More...
 
typedef std::pair< Point_d, FTPoint_with_transformed_distance
 Pair of point and transformed distance. More...
 
typedef unspecified_type iterator
 const input iterator with value type Point_with_transformed_distance for enumerating approximate neighbors. More...
 
typedef SpatialTree Tree
 The tree type. More...
 

Creation

 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. More...
 

Operations

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...
 

Member Typedef Documentation

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
typedef OrthogonalDistance CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::Distance

Distance type.

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
typedef Traits::FT CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::FT

Number type.

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
typedef unspecified_type CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::iterator

const input iterator with value type Point_with_transformed_distance for enumerating approximate neighbors.

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
typedef Traits::Point_d CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::Point_d

Point type.

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
typedef std::pair<Point_d,FT> CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::Point_with_transformed_distance

Pair of point and transformed distance.

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
typedef OrthogonalDistance::Query_item CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::Query_item

Query item.

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
typedef SpatialTree CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::Tree

The tree type.

Constructor & Destructor Documentation

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::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.

Member Function Documentation

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
iterator CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::begin ( ) const

Returns a const iterator to the approximate nearest or furthest neighbor.

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
iterator CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::end ( ) const

Returns the appropriate past-the-end const iterator.

template<typename Traits , typename OrthogonalDistance , typename Splitter , typename SpatialTree >
std::ostream& CGAL::Orthogonal_incremental_neighbor_search< Traits, OrthogonalDistance, Splitter, SpatialTree >::statistics ( std::ostream &  s) const

Inserts statistics of the search process into the output stream s.