#include <vector>#include <map>#include <functional>#include "hpp/fcl/fwd.hh"#include "hpp/fcl/BV/AABB.h"#include "hpp/fcl/broadphase/detail/morton.h"#include "hpp/fcl/broadphase/detail/node_base_array.h"#include "hpp/fcl/broadphase/detail/hierarchy_tree_array-inl.h"
Include dependency graph for hierarchy_tree_array.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| class | hpp::fcl::detail::implementation_array::HierarchyTree< BV > |
| Class for hierarchy tree structure. More... | |
| struct | hpp::fcl::detail::implementation_array::nodeBaseLess< BV > |
| Functor comparing two nodes. More... | |
| struct | hpp::fcl::detail::implementation_array::HierarchyTree< BV >::SortByMorton |
Namespaces | |
| hpp | |
| Main namespace. | |
| hpp::fcl | |
| hpp::fcl::detail | |
| hpp::fcl::detail::implementation_array | |
Functions | |
| template<typename BV > | |
| size_t | hpp::fcl::detail::implementation_array::select (const BV &query, size_t node1, size_t node2, NodeBase< BV > *nodes) |
| select the node from node1 and node2 which is close to the query AABB. 0 for node1 and 1 for node2. More... | |
| template<typename BV > | |
| size_t | hpp::fcl::detail::implementation_array::select (size_t query, size_t node1, size_t node2, NodeBase< BV > *nodes) |
| select the node from node1 and node2 which is close to the query-th node in the nodes. 0 for node1 and 1 for node2. More... | |