#include <vector>#include <map>#include <functional>#include <iostream>#include "coal/warning.hh"#include "coal/BV/AABB.h"#include "coal/broadphase/detail/morton.h"#include "coal/broadphase/detail/node_base.h"#include "coal/broadphase/detail/hierarchy_tree-inl.h"Go to the source code of this file.
|
| template<typename BV> |
| bool | coal::detail::nodeBaseLess (NodeBase< BV > *a, NodeBase< BV > *b, int d) |
| | Compare two nodes accoording to the d-th dimension of node center.
|
| template<typename BV> |
| 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
|
| template<typename BV> |
| 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
|