|
template<typename Container > |
void | build (const Container &container) |
|
void | clear () |
|
void | fromStream (std::istream &str) |
|
template<typename Type , typename Container > |
std::vector< std::pair< uint32_t, double > > | radiusSearch (const Container &container, const Type &val, double dist, bool sorted=true, int maxNN=-1) const |
|
template<typename Type , typename Container > |
void | radiusSearch (std::vector< std::pair< uint32_t, double > > &res, const Container &container, const Type &val, double dist, bool sorted=true, int maxNN=-1) |
|
template<typename Type , typename Container > |
std::vector< std::pair< uint32_t, double > > | searchKnn (const Container &container, const Type &val, int nn, bool sorted=true) |
|
void | toStream (std::ostream &str) const |
|
|
template<typename Container > |
void | computeBoundingBox (BoundingBox &bbox, int start, int end, const Container &container) |
|
template<typename Type > |
double | computeInitialDistances (const Type &elem, double dists[], const BoundingBox &bbox) const |
|
template<typename Container > |
void | divideTree (Index &index, uint64_t nodeIdx, int startIndex, int endIndex, BoundingBox &bbox, const Container &container) |
|
template<typename Type , typename Container > |
void | generalSearch (std::vector< std::pair< uint32_t, double > > &res, const Container &container, const Type &val, double dist, bool sorted=true, uint32_t maxNn=std::numeric_limits< int >::max()) const |
|
template<typename Container > |
void | mean_var_calculate (int startindex, int endIndex, double var[], double mean[], const Container &container) |
|
template<typename Container > |
void | planeSplit (uint32_t *ind, int count, int cutfeat, float cutval, int &lim1, int &lim2, const Container &container) |
|
template<typename Type , typename Container > |
void | searchExactLevel (const Index &index, int64_t nodeIdx, const Type &elem, ResultSet &res, double mindistsq, double dists[], double epsError, const Container &container) const |
|
template<int DIMS, typename Adapter, typename DistanceType = L2>
class picoflann::KdTreeIndex< DIMS, Adapter, DistanceType >
Definition at line 149 of file picoflann.h.
template<int DIMS, typename Adapter , typename DistanceType = L2>
template<typename Container >
SELECT THE COL (DIMENSION) ON WHICH PARTITION IS MADE
SELECT THE COL (DIMENSION) ON WHICH PARTITION IS MADE
Definition at line 261 of file picoflann.h.
template<int DIMS, typename Adapter , typename DistanceType = L2>
template<typename Container >
void picoflann::KdTreeIndex< DIMS, Adapter, DistanceType >::planeSplit |
( |
uint32_t * |
ind, |
|
|
int |
count, |
|
|
int |
cutfeat, |
|
|
float |
cutval, |
|
|
int & |
lim1, |
|
|
int & |
lim2, |
|
|
const Container & |
container |
|
) |
| |
|
inlineprivate |
Subdivide the list of points by a plane perpendicular on axe corresponding to the 'cutfeat' dimension at 'cutval' position.
On return: dataset[ind[0..lim1-1]][cutfeat]<cutval dataset[ind[lim1..lim2-1]][cutfeat]==cutval dataset[ind[lim2..count]][cutfeat]>cutval
Definition at line 463 of file picoflann.h.