rl::plan::Orthogonal_k_neighbor_search< SearchTraits, Distance, Splitter, Tree > Class Template Reference

#include <Orthogonal_k_neighbor_search.h>

Inheritance diagram for rl::plan::Orthogonal_k_neighbor_search< SearchTraits, Distance, Splitter, Tree >:

Public Types
typedef Base::FT	FT

Public Member Functions
	Orthogonal_k_neighbor_search (Tree &tree, const typename Base::Query_item &q, unsigned int k=1, FT Eps=FT(0.0), bool Search_nearest=true, const Distance &d=Distance(), bool sorted=true)

Private Types
typedef ::CGAL::internal::K_neighbor_search< SearchTraits, Distance, Splitter, Tree >	Base

Private Member Functions
void	compute_neighbors_orthogonally (typename Base::Node_handle N, FT rd)

Private Attributes
SearchTraits::Cartesian_const_iterator_d	query_object_it

Member Typedef Documentation

Base

template<class SearchTraits , class Distance = ::CGAL::Euclidean_distance<SearchTraits>, class Splitter = ::CGAL::Sliding_midpoint<SearchTraits>, class Tree = ::CGAL::Kd_tree<SearchTraits, Splitter, ::CGAL::Tag_true>>

typedef ::CGAL::internal::K_neighbor_search<SearchTraits,Distance,Splitter,Tree> rl::plan::Orthogonal_k_neighbor_search< SearchTraits, Distance, Splitter, Tree >::Base

private

FT

template<class SearchTraits , class Distance = ::CGAL::Euclidean_distance<SearchTraits>, class Splitter = ::CGAL::Sliding_midpoint<SearchTraits>, class Tree = ::CGAL::Kd_tree<SearchTraits, Splitter, ::CGAL::Tag_true>>

typedef Base::FT rl::plan::Orthogonal_k_neighbor_search< SearchTraits, Distance, Splitter, Tree >::FT

Constructor & Destructor Documentation

Orthogonal_k_neighbor_search()

template<class SearchTraits , class Distance = ::CGAL::Euclidean_distance<SearchTraits>, class Splitter = ::CGAL::Sliding_midpoint<SearchTraits>, class Tree = ::CGAL::Kd_tree<SearchTraits, Splitter, ::CGAL::Tag_true>>

rl::plan::Orthogonal_k_neighbor_search< SearchTraits, Distance, Splitter, Tree >::Orthogonal_k_neighbor_search ( Tree &  tree, const typename Base::Query_item &  q, unsigned int  k = 1, FT  Eps = FT(0.0), bool  Search_nearest = true, const Distance &  d = Distance(), bool  sorted = true  )

inline

Member Function Documentation

compute_neighbors_orthogonally()

template<class SearchTraits , class Distance = ::CGAL::Euclidean_distance<SearchTraits>, class Splitter = ::CGAL::Sliding_midpoint<SearchTraits>, class Tree = ::CGAL::Kd_tree<SearchTraits, Splitter, ::CGAL::Tag_true>>

void rl::plan::Orthogonal_k_neighbor_search< SearchTraits, Distance, Splitter, Tree >::compute_neighbors_orthogonally ( typename Base::Node_handle  N, FT  rd  )

inlineprivate

Member Data Documentation

query_object_it

template<class SearchTraits , class Distance = ::CGAL::Euclidean_distance<SearchTraits>, class Splitter = ::CGAL::Sliding_midpoint<SearchTraits>, class Tree = ::CGAL::Kd_tree<SearchTraits, Splitter, ::CGAL::Tag_true>>

SearchTraits::Cartesian_const_iterator_d rl::plan::Orthogonal_k_neighbor_search< SearchTraits, Distance, Splitter, Tree >::query_object_it

private

---

The documentation for this class was generated from the following file:

• rl/plan/Orthogonal_k_neighbor_search.h