Classes | |
class | HierarchyTree |
Class for hierarchy tree structure. More... | |
struct | NodeBase |
struct | nodeBaseLess |
Functor comparing two nodes. More... | |
Functions | |
template<typename BV > | |
size_t | 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. | |
template<> | |
size_t | select (size_t query, size_t node1, size_t node2, NodeBase< AABB > *nodes) |
template<typename BV > | |
size_t | 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. | |
template<> | |
size_t | select (const AABB &query, size_t node1, size_t node2, NodeBase< AABB > *nodes) |
size_t fcl::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.
Definition at line 368 of file hierarchy_tree.h.
size_t fcl::implementation_array::select | ( | size_t | query, |
size_t | node1, | ||
size_t | node2, | ||
NodeBase< AABB > * | nodes | ||
) |
Definition at line 106 of file hierarchy_tree.cpp.
size_t fcl::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.
Definition at line 378 of file hierarchy_tree.h.
size_t fcl::implementation_array::select | ( | const AABB & | query, |
size_t | node1, | ||
size_t | node2, | ||
NodeBase< AABB > * | nodes | ||
) |
Definition at line 120 of file hierarchy_tree.cpp.