38 #ifndef PCL_SEARCH_KDTREE_IMPL_HPP_
39 #define PCL_SEARCH_KDTREE_IMPL_HPP_
41 #include <pcl/search/kdtree.h>
42 #include <pcl/search/impl/search.hpp>
45 template <
typename Po
intT,
class Tree>
48 , tree_ (new Tree (sorted))
53 template <
typename Po
intT,
class Tree>
void
57 tree_->setPointRepresentation (point_representation);
61 template <
typename Po
intT,
class Tree>
void
64 sorted_results_ = sorted_results;
65 tree_->setSortedResults (sorted_results);
69 template <
typename Po
intT,
class Tree>
void
72 tree_->setEpsilon (eps);
76 template <
typename Po
intT,
class Tree>
void
81 tree_->setInputCloud (cloud, indices);
87 template <
typename Po
intT,
class Tree>
int
90 std::vector<float> &k_sqr_distances)
const
92 return (tree_->nearestKSearch (point, k, k_indices, k_sqr_distances));
96 template <
typename Po
intT,
class Tree>
int
98 const PointT& point,
double radius,
99 Indices &k_indices, std::vector<float> &k_sqr_distances,
100 unsigned int max_nn)
const
102 return (tree_->radiusSearch (point, radius, k_indices, k_sqr_distances, max_nn));
105 #define PCL_INSTANTIATE_KdTree(T) template class PCL_EXPORTS pcl::search::KdTree<T>;
107 #endif //#ifndef _PCL_SEARCH_KDTREE_IMPL_HPP_
KdTree(bool sorted=true)
Constructor for KdTree.
void setPointRepresentation(const PointRepresentationConstPtr &point_representation)
Provide a pointer to the point representation to use to convert points into k-D vectors.
void setSortedResults(bool sorted_results) override
Sets whether the results have to be sorted or not.
std::vector< index_t > Indices
Type used for indices in PCL.
typename PointRepresentation< PointT >::ConstPtr PointRepresentationConstPtr
pcl::IndicesConstPtr IndicesConstPtr
typename Search< PointT >::PointCloudConstPtr PointCloudConstPtr
void setEpsilon(float eps)
Set the search epsilon precision (error bound) for nearest neighbors searches.
void setInputCloud(const PointCloudConstPtr &cloud, const IndicesConstPtr &indices=IndicesConstPtr()) override
Provide a pointer to the input dataset.
int nearestKSearch(const PointT &point, int k, Indices &k_indices, std::vector< float > &k_sqr_distances) const override
Search for the k-nearest neighbors for the given query point.
A point structure representing Euclidean xyz coordinates, and the RGB color.
int radiusSearch(const PointT &point, double radius, Indices &k_indices, std::vector< float > &k_sqr_distances, unsigned int max_nn=0) const override
Search for all the nearest neighbors of the query point in a given radius.