clear() (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
depth() const (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
empty() const (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | inline |
erase(Node *node, KDNode< N, T, P > *parent=nullptr) (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
find(const Vector< N, P > &pos) (defined in inviwo::KDTreeGlm< N, T, P >) | inviwo::KDTreeGlm< N, T, P > | inline |
find(const P pos[N]) (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
findCloseTo(const Vector< N, P > &pos, const P distance) (defined in inviwo::KDTreeGlm< N, T, P >) | inviwo::KDTreeGlm< N, T, P > | inline |
findCloseTo(const P pos[N], const P distance) (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
findMax(unsigned int dim) (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
findMin(unsigned int dim) (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
findNearest(const Vector< N, P > &pos) (defined in inviwo::KDTreeGlm< N, T, P >) | inviwo::KDTreeGlm< N, T, P > | inline |
findNearest(const P pos[N]) (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
findNNearest(const Vector< N, P > &pos, const int &amount) (defined in inviwo::KDTreeGlm< N, T, P >) | inviwo::KDTreeGlm< N, T, P > | inline |
findNNearest(const P pos[N], int amount) (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
getAsVector() (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
getRoot() (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | inline |
insert(const Vector< N, P > &pos, const T &data) (defined in inviwo::KDTreeGlm< N, T, P >) | inviwo::KDTreeGlm< N, T, P > | inline |
insert(const P pos[N], const T &data) (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
isOk() const (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
KDTree() (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
KDTree(const KDTree &tree) (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | inline |
KDTreeGlm() (defined in inviwo::KDTreeGlm< N, T, P >) | inviwo::KDTreeGlm< N, T, P > | inline |
Node typedef (defined in inviwo::KDTreeGlm< N, T, P >) | inviwo::KDTreeGlm< N, T, P > | |
operator=(const KDTree &rhs) (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | inline |
size() const (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | |
Tree typedef (defined in inviwo::KDTreeGlm< N, T, P >) | inviwo::KDTreeGlm< N, T, P > | |
~KDTree() (defined in inviwo::KDTree< N, T, P >) | inviwo::KDTree< N, T, P > | virtual |
~KDTreeGlm() (defined in inviwo::KDTreeGlm< N, T, P >) | inviwo::KDTreeGlm< N, T, P > | inlinevirtual |