clipRange(int &begin, int &end, int min, int max) const | pcl::search::OrganizedNeighbor2< PointT > | inlineprotected |
ConstPtr typedef | pcl::search::OrganizedNeighbor2< PointT > | |
getProjectedRadiusSearchBox(const PointT &point, float squared_radius, unsigned &minX, unsigned &minY, unsigned &maxX, unsigned &maxY) const | pcl::search::OrganizedNeighbor2< PointT > | protected |
IndicesConstPtr typedef | pcl::search::OrganizedNeighbor2< PointT > | |
intrinsics_matrix_ | pcl::search::OrganizedNeighbor2< PointT > | protected |
KR_KRT_ | pcl::search::OrganizedNeighbor2< PointT > | protected |
mask_ | pcl::search::OrganizedNeighbor2< PointT > | protected |
nearestKSearch(const PointT &p_q, int k, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances) const | pcl::search::OrganizedNeighbor2< PointT > | |
OrganizedNeighbor2(bool sorted_results=false) | pcl::search::OrganizedNeighbor2< PointT > | inlineexplicit |
PointCloud typedef | pcl::search::OrganizedNeighbor2< PointT > | |
PointCloudConstPtr typedef | pcl::search::OrganizedNeighbor2< PointT > | |
PointCloudPtr typedef | pcl::search::OrganizedNeighbor2< PointT > | |
projectPoint(const Eigen::Vector3f &p) const | pcl::search::OrganizedNeighbor2< PointT > | |
Ptr typedef | pcl::search::OrganizedNeighbor2< PointT > | |
radiusSearch(const PointT &p_q, double radius, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances, unsigned int max_nn=0) const | pcl::search::OrganizedNeighbor2< PointT > | |
setInputCloud(const PointCloudConstPtr &cloud, const IndicesConstPtr &indices=IndicesConstPtr()) | pcl::search::OrganizedNeighbor2< PointT > | inlinevirtual |
setIntrinsicsMatrix(const Eigen::Matrix3d &intrinsics_matrix) | pcl::search::OrganizedNeighbor2< PointT > | inline |
testPoint(const PointT &query, unsigned k, std::priority_queue< Entry > &queue, unsigned index) const | pcl::search::OrganizedNeighbor2< PointT > | inlineprotected |
~OrganizedNeighbor2() | pcl::search::OrganizedNeighbor2< PointT > | inlinevirtual |