| balanceBottomup() | hpp::fcl::detail::HierarchyTree< BV > | |
| balanceIncremental(int iterations) | hpp::fcl::detail::HierarchyTree< BV > | |
| balanceTopdown() | hpp::fcl::detail::HierarchyTree< BV > | |
| bottomup(const NodeVecIterator lbeg, const NodeVecIterator lend) | hpp::fcl::detail::HierarchyTree< BV > | private |
| bu_threshold | hpp::fcl::detail::HierarchyTree< BV > | |
| clear() | hpp::fcl::detail::HierarchyTree< BV > | |
| createNode(Node *parent, const BV &bv, void *data) | hpp::fcl::detail::HierarchyTree< BV > | private |
| createNode(Node *parent, const BV &bv1, const BV &bv2, void *data) | hpp::fcl::detail::HierarchyTree< BV > | private |
| createNode(Node *parent, void *data) | hpp::fcl::detail::HierarchyTree< BV > | private |
| deleteNode(Node *node) | hpp::fcl::detail::HierarchyTree< BV > | private |
| empty() const | hpp::fcl::detail::HierarchyTree< BV > | |
| extractLeaves(const Node *root, std::vector< Node * > &leaves) const | hpp::fcl::detail::HierarchyTree< BV > | |
| fetchLeaves(Node *root, std::vector< Node * > &leaves, int depth=-1) | hpp::fcl::detail::HierarchyTree< BV > | private |
| free_node | hpp::fcl::detail::HierarchyTree< BV > | protected |
| getMaxDepth() const | hpp::fcl::detail::HierarchyTree< BV > | |
| getMaxDepth(Node *node, size_t depth, size_t &max_depth) const | hpp::fcl::detail::HierarchyTree< BV > | private |
| getMaxHeight() const | hpp::fcl::detail::HierarchyTree< BV > | |
| getMaxHeight(Node *node) const | hpp::fcl::detail::HierarchyTree< BV > | private |
| getRoot() const | hpp::fcl::detail::HierarchyTree< BV > | |
| getRoot() | hpp::fcl::detail::HierarchyTree< BV > | |
| HierarchyTree(int bu_threshold_=16, int topdown_level_=0) | hpp::fcl::detail::HierarchyTree< BV > | |
| indexOf(Node *node) | hpp::fcl::detail::HierarchyTree< BV > | privatestatic |
| init(std::vector< Node * > &leaves, int level=0) | hpp::fcl::detail::HierarchyTree< BV > | |
| init_0(std::vector< Node * > &leaves) | hpp::fcl::detail::HierarchyTree< BV > | private |
| init_1(std::vector< Node * > &leaves) | hpp::fcl::detail::HierarchyTree< BV > | private |
| init_2(std::vector< Node * > &leaves) | hpp::fcl::detail::HierarchyTree< BV > | private |
| init_3(std::vector< Node * > &leaves) | hpp::fcl::detail::HierarchyTree< BV > | private |
| insert(const BV &bv, void *data) | hpp::fcl::detail::HierarchyTree< BV > | |
| insertLeaf(Node *const sub_root, Node *const leaf) | hpp::fcl::detail::HierarchyTree< BV > | private |
| max_lookahead_level | hpp::fcl::detail::HierarchyTree< BV > | protected |
| mortonRecurse_0(const NodeVecIterator lbeg, const NodeVecIterator lend, const uint32_t &split, int bits) | hpp::fcl::detail::HierarchyTree< BV > | private |
| mortonRecurse_1(const NodeVecIterator lbeg, const NodeVecIterator lend, const uint32_t &split, int bits) | hpp::fcl::detail::HierarchyTree< BV > | private |
| mortonRecurse_2(const NodeVecIterator lbeg, const NodeVecIterator lend) | hpp::fcl::detail::HierarchyTree< BV > | private |
| n_leaves | hpp::fcl::detail::HierarchyTree< BV > | protected |
| Node typedef | hpp::fcl::detail::HierarchyTree< BV > | |
| NodeVecConstIterator typedef | hpp::fcl::detail::HierarchyTree< BV > | private |
| NodeVecIterator typedef | hpp::fcl::detail::HierarchyTree< BV > | private |
| opath | hpp::fcl::detail::HierarchyTree< BV > | protected |
| print(Node *root, int depth) | hpp::fcl::detail::HierarchyTree< BV > | |
| recurseDeleteNode(Node *node) | hpp::fcl::detail::HierarchyTree< BV > | private |
| recurseRefit(Node *node) | hpp::fcl::detail::HierarchyTree< BV > | private |
| refit() | hpp::fcl::detail::HierarchyTree< BV > | |
| remove(Node *leaf) | hpp::fcl::detail::HierarchyTree< BV > | |
| removeLeaf(Node *const leaf) | hpp::fcl::detail::HierarchyTree< BV > | private |
| root_node | hpp::fcl::detail::HierarchyTree< BV > | protected |
| size() const | hpp::fcl::detail::HierarchyTree< BV > | |
| sort(Node *n, Node *&r) | hpp::fcl::detail::HierarchyTree< BV > | private |
| topdown(const NodeVecIterator lbeg, const NodeVecIterator lend) | hpp::fcl::detail::HierarchyTree< BV > | private |
| topdown_0(const NodeVecIterator lbeg, const NodeVecIterator lend) | hpp::fcl::detail::HierarchyTree< BV > | private |
| topdown_1(const NodeVecIterator lbeg, const NodeVecIterator lend) | hpp::fcl::detail::HierarchyTree< BV > | private |
| topdown_level | hpp::fcl::detail::HierarchyTree< BV > | |
| update(Node *leaf, int lookahead_level=-1) | hpp::fcl::detail::HierarchyTree< BV > | |
| update(Node *leaf, const BV &bv) | hpp::fcl::detail::HierarchyTree< BV > | |
| update(Node *leaf, const BV &bv, const Vec3f &vel, FCL_REAL margin) | hpp::fcl::detail::HierarchyTree< BV > | |
| update(Node *leaf, const BV &bv, const Vec3f &vel) | hpp::fcl::detail::HierarchyTree< BV > | |
| update_(Node *leaf, const BV &bv) | hpp::fcl::detail::HierarchyTree< BV > | private |
| ~HierarchyTree() | hpp::fcl::detail::HierarchyTree< BV > | |