An instance of this class can be used to greedily select a given number of representatives from a set of data points that are all far apart from each other. More...
#include <GreedyKCenters.h>
Public Types | |
typedef boost::function2 < double, const _T &, const _T & > | DistanceFunction |
The definition of a distance function. | |
Public Member Functions | |
void | setDistanceFunction (const DistanceFunction &distFun) |
Set the distance function to use. | |
const DistanceFunction & | getDistanceFunction (void) const |
Get the distance function used. | |
void | kcenters (const std::vector< _T > &data, unsigned int k, std::vector< unsigned int > ¢ers, std::vector< std::vector< double > > &dists) |
Greedy algorithm for selecting k centers. | |
Protected Attributes | |
DistanceFunction | distFun_ |
The used distance function. | |
RNG | rng_ |
An instance of this class can be used to greedily select a given number of representatives from a set of data points that are all far apart from each other.
Definition at line 48 of file GreedyKCenters.h.
void ompl::GreedyKCenters< _T >::kcenters | ( | const std::vector< _T > & | data, |
unsigned int | k, | ||
std::vector< unsigned int > & | centers, | ||
std::vector< std::vector< double > > & | dists | ||
) | [inline] |
Greedy algorithm for selecting k centers.
data | a vector of data points |
k | the desired number of centers |
centers | a vector of length k containing the indices into data of the k centers |
dists | a 2-dimensional array such that dists[i][j] is the distance between data[i] and data[center[j]] |
Definition at line 82 of file GreedyKCenters.h.
RNG ompl::GreedyKCenters< _T >::rng_ [protected] |
Random number generator used to select first center
Definition at line 126 of file GreedyKCenters.h.