clone() (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
depth() const (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
find(const P pos[N]) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
findCloseTo(const P pos[N], const P squaredDistance, std::vector< KDNode * > &nodes) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
findMax(unsigned int dim) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
findMin(unsigned int dim) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
findNearest(const P pos[N], KDNode *nearest) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
findNNearest(const P pos[N], size_t amount, std::vector< KDNodeDistWrapper< N, T, P > > ¤t) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
findParent(const KDNode *n) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
get() (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
get() const (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
getAsVector(std::vector< KDNode * > &nodes) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | inline |
getChilds() (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | inline |
getDataAsPointer() (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | inline |
getLeftChild() (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | inline |
getPosition() (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
getRightChild() (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | inline |
insert(const P pos[N], const T &data) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
isLeaf() const (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
isLeftLeaf() const (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
isOk() const (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
isRightLeaf() const (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
KDNode(const P pos[N], const T &data, KDNode *parent=0) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
KDTree< N, T, P > (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | friend |
size() const (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | |
swap(KDNode< N, T, P > *n0, KDNode< N, T, P > *n1, KDNode< N, T, P > *p0, KDNode< N, T, P > *p1) (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | static |
~KDNode() (defined in inviwo::KDNode< N, T, P >) | inviwo::KDNode< N, T, P > | virtual |