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