#include <KdTree.h>
template<typename NodeData , unsigned char K = 3, class LookupProc = NullLookupProc>
template<typename NodeData , unsigned char K, typename LookupProc >
template<typename NodeDataVector >
template<typename NodeData , unsigned char K = 3, class LookupProc = NullLookupProc>
template<typename NodeData , unsigned char K = 3, class LookupProc = NullLookupProc>
template<typename NodeData , unsigned char K, typename LookupProc >
template<typename NodeDataVector >
template<typename NodeData , unsigned char K, typename LookupProc >
void cinder::KdTree< NodeData, K, LookupProc >::recursiveBuild |
( |
uint32_t |
nodeNum, |
|
|
uint32_t |
start, |
|
|
uint32_t |
end, |
|
|
std::vector< NodeDataIndex > & |
buildNodes |
|
) |
| |
template<typename NodeData , unsigned char K, typename LookupProc >
void cinder::KdTree< NodeData, K, LookupProc >::lookup |
( |
const NodeData & |
p, |
|
|
const LookupProc & |
process, |
|
|
float |
maxDist |
|
) |
| const |
template<typename NodeData , unsigned char K, typename LookupProc >
void cinder::KdTree< NodeData, K, LookupProc >::findNearest |
( |
float |
p[K], |
|
|
float |
result[K], |
|
|
uint32_t * |
resultIndex |
|
) |
| const |
The documentation for this class was generated from the following file: