Namespaces | |
| dynamic_AABB_tree | |
| dynamic_AABB_tree_array | |
| implementation_array | |
Classes | |
| class | HierarchyTree |
| Class for hierarchy tree structure. More... | |
| class | IntervalTree |
| Interval tree. More... | |
| class | IntervalTreeNode |
| The node for interval tree. More... | |
| struct | it_recursion_node |
| Class describes the information needed when we take the right branch in searching for intervals but possibly come back and check the left branch as well. More... | |
| struct | NodeBase |
| dynamic AABB tree node More... | |
| struct | SelectImpl |
| struct | SelectImpl< S, AABB > |
| class | SimpleHashTable |
| A simple hash table implemented as multiple buckets. HashFnc is any extended hash function: HashFnc(key) = {index1, index2, ..., }. More... | |
| struct | SimpleInterval |
| Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest. More... | |
| class | SparseHashTable |
| A hash table implemented using unordered_map. More... | |
| struct | SpatialHash |
| Spatial hash function: hash an AABB to a set of integer values. More... | |
| class | unordered_map_hash_table |
| struct | UpdateImpl |
Functions | |
| template<typename BV > | |
| bool | nodeBaseLess (NodeBase< BV > *a, NodeBase< BV > *b, int d) |
| Compare two nodes accoording to the d-th dimension of node center. More... | |
| bool | overlap (CoalScalar a1, CoalScalar a2, CoalScalar b1, CoalScalar b2) |
| returns 1 if the intervals overlap, and 0 otherwise More... | |
| template<typename BV > | |
| size_t | 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 | 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... | |
Variables | |
| class COAL_DLLAPI | IntervalTree |
| bool coal::detail::nodeBaseLess | ( | NodeBase< BV > * | a, |
| NodeBase< BV > * | b, | ||
| int | d | ||
| ) |
Compare two nodes accoording to the d-th dimension of node center.
Definition at line 930 of file coal/broadphase/detail/hierarchy_tree-inl.h.
| bool coal::detail::overlap | ( | CoalScalar | a1, |
| CoalScalar | a2, | ||
| CoalScalar | b1, | ||
| CoalScalar | b2 | ||
| ) |
returns 1 if the intervals overlap, and 0 otherwise
Definition at line 412 of file interval_tree.cpp.
| size_t coal::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
Definition at line 959 of file coal/broadphase/detail/hierarchy_tree-inl.h.
| size_t coal::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
Definition at line 952 of file coal/broadphase/detail/hierarchy_tree-inl.h.
| class COAL_DLLAPI coal::detail::IntervalTree |
Definition at line 48 of file coal/broadphase/detail/interval_tree_node.h.