balanceBottomup() | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
balanceIncremental(int iterations) | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
balanceTopdown() | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
bu_threshold | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
clear() | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
empty() const | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
extractLeaves(size_t root, Node *&leaves) const | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
freelist | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | protected |
getMaxDepth() const | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
getMaxHeight() const | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
getNodes() const | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
getRoot() const | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
HierarchyTree(int bu_threshold_=16, int topdown_level_=0) | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
init(Node *leaves, int n_leaves_, int level=0) | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
insert(const BV &bv, void *data) | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
max_lookahead_level | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | protected |
n_leaves | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | protected |
n_nodes | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | protected |
n_nodes_alloc | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | protected |
Node typedef | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
nodes | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | protected |
NULL_NODE | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | static |
opath | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | protected |
print(size_t root, int depth) | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
refit() | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
remove(size_t leaf) | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
root_node | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | protected |
size() const | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
topdown_level | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
update(size_t leaf, int lookahead_level=-1) | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
update(size_t leaf, const BV &bv) | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
update(size_t leaf, const BV &bv, const Vec3f &vel, FCL_REAL margin) | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
update(size_t leaf, const BV &bv, const Vec3f &vel) | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |
~HierarchyTree() | hpp::fcl::detail::implementation_array::HierarchyTree< BV > | |