#include <vector>#include <map>#include <functional>#include <iostream>#include "fcl/common/warning.h"#include "fcl/math/bv/AABB.h"#include "fcl/broadphase/detail/morton.h"#include "fcl/broadphase/detail/node_base.h"#include "fcl/broadphase/detail/hierarchy_tree-inl.h"
Include dependency graph for hierarchy_tree.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| class | fcl::detail::HierarchyTree< BV > |
| Class for hierarchy tree structure. More... | |
| struct | fcl::detail::HierarchyTree< BV >::SortByMorton |
Namespaces | |
| fcl | |
| Main namespace. | |
| fcl::detail | |
Functions | |
| template<typename BV > | |
| bool | fcl::detail::nodeBaseLess (NodeBase< BV > *a, NodeBase< BV > *b, int d) |
| Compare two nodes accoording to the d-th dimension of node center. More... | |
| template<typename BV > | |
| size_t | fcl::detail::select (const BV &query, const NodeBase< BV > &node1, const NodeBase< BV > &node2) |
| select from node1 and node2 which is close to a given query bounding volume. 0 for node1 and 1 for node2 More... | |
| template<typename BV > | |
| size_t | fcl::detail::select (const NodeBase< BV > &query, const NodeBase< BV > &node1, const NodeBase< BV > &node2) |
| select from node1 and node2 which is close to a given query. 0 for node1 and 1 for node2 More... | |