Point Cloud Library (PCL) 1.15.1
Loading...
Searching...
No Matches
pcl::search::KdTreeNanoflann< PointT, Dim, Distance, L2_Adaptor, L2_Simple_Adaptor, Tree > Member List

This is the complete list of members for pcl::search::KdTreeNanoflann< PointT, Dim, Distance, L2_Adaptor, L2_Simple_Adaptor, Tree >, including all inherited members.

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