Point Cloud Library (PCL)  1.7.1
pcl::search::BruteForce< PointT > Class Template Reference

Implementation of a simple brute force search algorithm. More...

`#include <pcl/search/brute_force.h>` Inheritance diagram for pcl::search::BruteForce< PointT >:

## Public Member Functions

BruteForce (bool sorted_results=false)

virtual ~BruteForce ()
Destructor for KdTree. More...

int nearestKSearch (const PointT &point, int k, std::vector< int > &k_indices, std::vector< float > &k_distances) const
Search for the k-nearest neighbors for the given query point. More...

int radiusSearch (const PointT &point, double radius, std::vector< int > &k_indices, std::vector< float > &k_sqr_distances, unsigned int max_nn=0) const
Search for all the nearest neighbors of the query point in a given radius. More...

## Detailed Description

### template<typename PointT> class pcl::search::BruteForce< PointT >

Implementation of a simple brute force search algorithm.

Definition at line 52 of file brute_force.h.

## Constructor & Destructor Documentation

template<typename PointT >
 pcl::search::BruteForce< PointT >::BruteForce ( bool sorted_results = `false`)
inline

Definition at line 88 of file brute_force.h.

template<typename PointT >
 virtual pcl::search::BruteForce< PointT >::~BruteForce ( )
inlinevirtual

Destructor for KdTree.

Definition at line 95 of file brute_force.h.

## Member Function Documentation

template<typename PointT >
 int pcl::search::BruteForce< PointT >::nearestKSearch ( const PointT & point, int k, std::vector< int > & k_indices, std::vector< float > & k_distances ) const
virtual

Search for the k-nearest neighbors for the given query point.

Parameters
 [in] point the given query point [in] k the number of neighbors to search for [out] k_indices the resultant indices of the neighboring points (must be resized to k a priori!) [out] k_distances the resultant squared distances to the neighboring points (must be resized to k a priori!)
Returns
number of neighbors found

Implements pcl::search::Search< PointT >.

Definition at line 54 of file brute_force.hpp.

References pcl::isFinite().

template<typename PointT >
 int pcl::search::BruteForce< PointT >::radiusSearch ( const PointT & point, double radius, std::vector< int > & k_indices, std::vector< float > & k_sqr_distances, unsigned int max_nn = `0` ) const
virtual

Search for all the nearest neighbors of the query point in a given radius.

Parameters
 [in] point the given query point [in] radius the radius of the sphere bounding all of p_q's neighbors [out] k_indices the resultant indices of the neighboring points [out] k_sqr_distances the resultant squared distances to the neighboring points [in] max_nn if given, bounds the maximum returned neighbors to this value. If max_nn is set to 0 or to a number higher than the number of points in the input cloud, all neighbors in radius will be returned.
Returns
number of neighbors found in radius

Implements pcl::search::Search< PointT >.

Definition at line 335 of file brute_force.hpp.

References pcl::isFinite().

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