hpp::fcl::detail Namespace Reference

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 (FCL_REAL a1, FCL_REAL a2, FCL_REAL b1, FCL_REAL b2)
	returns 1 if the intervals overlap, and 0 otherwise 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...
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...

Variables
class HPP_FCL_DLLAPI	IntervalTree

Function Documentation

nodeBaseLess()

template<typename BV >

bool hpp::fcl::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 hierarchy_tree-inl.h.

overlap()

bool hpp::fcl::detail::overlap	(	FCL_REAL	a1,
		FCL_REAL	a2,
		FCL_REAL	b1,
		FCL_REAL	b2
	)

returns 1 if the intervals overlap, and 0 otherwise

Definition at line 410 of file interval_tree.cpp.

select() [1/2]

template<typename BV >

size_t hpp::fcl::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 hierarchy_tree-inl.h.

select() [2/2]

template<typename BV >

size_t hpp::fcl::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 hierarchy_tree-inl.h.

Variable Documentation

IntervalTree

class HPP_FCL_DLLAPI hpp::fcl::detail::IntervalTree

Definition at line 49 of file interval_tree_node.h.