Point Cloud Library (PCL)  1.9.1-dev
pcl::search::KdTree< PointT, Tree > Member List

This is the complete list of members for pcl::search::KdTree< PointT, Tree >, including all inherited members.

ConstPtr typedefpcl::search::KdTree< PointT, Tree >
getEpsilon() const pcl::search::KdTree< PointT, Tree >inline
getIndices() const pcl::search::Search< PointT >inlinevirtual
getInputCloud() const pcl::search::Search< PointT >inlinevirtual
getName() const pcl::search::Search< PointT >virtual
getPointRepresentation() const pcl::search::KdTree< PointT, Tree >inline
getSortedResults()pcl::search::Search< PointT >virtual
indices_pcl::search::Search< PointT >protected
IndicesConstPtr typedefpcl::search::KdTree< PointT, Tree >
IndicesPtr typedefpcl::search::KdTree< PointT, Tree >
input_pcl::search::Search< PointT >protected
KdTree(bool sorted=true)pcl::search::KdTree< PointT, Tree >
KdTreeConstPtr typedefpcl::search::KdTree< PointT, Tree >
KdTreePtr typedefpcl::search::KdTree< PointT, Tree >
name_pcl::search::Search< PointT >protected
nearestKSearch(const PointT &point, int k, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances) const overridepcl::search::KdTree< PointT, Tree >virtual
pcl::search::Search::nearestKSearch(const PointCloud &cloud, int index, int k, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances) const pcl::search::Search< PointT >virtual
pcl::search::Search::nearestKSearch(int index, int k, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances) const pcl::search::Search< PointT >virtual
pcl::search::Search::nearestKSearch(const PointCloud &cloud, const std::vector< int > &indices, int k, std::vector< std::vector< int > > &k_indices, std::vector< std::vector< float > > &k_sqr_distances) const pcl::search::Search< PointT >virtual
nearestKSearchT(const PointTDiff &point, int k, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances) const pcl::search::Search< PointT >inline
nearestKSearchT(const pcl::PointCloud< PointTDiff > &cloud, const std::vector< int > &indices, int k, std::vector< std::vector< int > > &k_indices, std::vector< std::vector< float > > &k_sqr_distances) const pcl::search::Search< PointT >inline
PointCloud typedefpcl::search::KdTree< PointT, Tree >
PointCloudConstPtr typedefpcl::search::KdTree< PointT, Tree >
PointCloudPtr typedefpcl::search::Search< PointT >
PointRepresentationConstPtr typedefpcl::search::KdTree< PointT, Tree >
Ptr typedefpcl::search::KdTree< PointT, Tree >
radiusSearch(const PointT &point, double radius, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances, unsigned int max_nn=0) const overridepcl::search::KdTree< PointT, Tree >virtual
pcl::search::Search::radiusSearch(const PointCloud &cloud, int index, double radius, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances, unsigned int max_nn=0) const pcl::search::Search< PointT >virtual
pcl::search::Search::radiusSearch(int index, double radius, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances, unsigned int max_nn=0) const pcl::search::Search< PointT >virtual
pcl::search::Search::radiusSearch(const PointCloud &cloud, const std::vector< int > &indices, double radius, std::vector< std::vector< int > > &k_indices, std::vector< std::vector< float > > &k_sqr_distances, unsigned int max_nn=0) const pcl::search::Search< PointT >virtual
radiusSearchT(const PointTDiff &point, double radius, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances, unsigned int max_nn=0) const pcl::search::Search< PointT >inline
radiusSearchT(const pcl::PointCloud< PointTDiff > &cloud, const std::vector< int > &indices, double radius, std::vector< std::vector< int > > &k_indices, std::vector< std::vector< float > > &k_sqr_distances, unsigned int max_nn=0) const pcl::search::Search< PointT >inline
Search(const std::string &name="", bool sorted=false)pcl::search::Search< PointT >
setEpsilon(float eps)pcl::search::KdTree< PointT, Tree >
setInputCloud(const PointCloudConstPtr &cloud, const IndicesConstPtr &indices=IndicesConstPtr()) overridepcl::search::KdTree< PointT, Tree >
pcl::search::Search::setInputCloud(const PointCloudConstPtr &cloud, const IndicesConstPtr &indices=IndicesConstPtr())pcl::search::Search< PointT >virtual
setPointRepresentation(const PointRepresentationConstPtr &point_representation)pcl::search::KdTree< PointT, Tree >
setSortedResults(bool sorted_results) overridepcl::search::KdTree< PointT, Tree >virtual
sorted_results_pcl::search::Search< PointT >protected
sortResults(std::vector< int > &indices, std::vector< float > &distances) const pcl::search::Search< PointT >protected
tree_pcl::search::KdTree< PointT, Tree >protected
~KdTree()pcl::search::KdTree< PointT, Tree >inline
~Search()pcl::search::Search< PointT >inlinevirtual