hierarchy_tree.h File Reference

#include <vector>
#include <map>
#include "fcl/BV/AABB.h"
#include "fcl/broadphase/morton.h"
#include <boost/bind.hpp>
#include <boost/iterator/zip_iterator.hpp>
#include "fcl/broadphase/hierarchy_tree.hxx"

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::implementation_array::HierarchyTree< BV >
	Class for hierarchy tree structure. More...
class	fcl::HierarchyTree< BV >
	Class for hierarchy tree structure. More...
struct	fcl::implementation_array::NodeBase< BV >
struct	fcl::NodeBase< BV >
	dynamic AABB tree node More...
struct	fcl::implementation_array::nodeBaseLess< BV >
	Functor comparing two nodes. More...
struct	fcl::implementation_array::HierarchyTree< BV >::SortByMorton
struct	fcl::HierarchyTree< BV >::SortByMorton
Namespaces
namespace	fcl
	Main namespace.
namespace	fcl::implementation_array
Functions
template<typename BV >
bool	fcl::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	fcl::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<>
size_t	fcl::select (const NodeBase< AABB > &node, const NodeBase< AABB > &node1, const NodeBase< AABB > &node2)
template<typename BV >
size_t	fcl::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
template<>
size_t	fcl::select (const AABB &query, const NodeBase< AABB > &node1, const NodeBase< AABB > &node2)
template<typename BV >
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.
template<>
size_t	fcl::implementation_array::select (size_t query, size_t node1, size_t node2, NodeBase< AABB > *nodes)
template<typename BV >
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.
template<>
size_t	fcl::implementation_array::select (const AABB &query, size_t node1, size_t node2, NodeBase< AABB > *nodes)