Classes | Namespaces | Functions
hierarchy_tree.h File Reference
#include <vector>
#include <map>
#include <functional>
#include <iostream>
#include "hpp/fcl/warning.hh"
#include "hpp/fcl/BV/AABB.h"
#include "hpp/fcl/broadphase/detail/morton.h"
#include "hpp/fcl/broadphase/detail/node_base.h"
#include "hpp/fcl/broadphase/detail/hierarchy_tree-inl.h"
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  hpp::fcl::detail::HierarchyTree< BV >
 Class for hierarchy tree structure. More...
 
struct  hpp::fcl::detail::HierarchyTree< BV >::SortByMorton
 

Namespaces

 hpp
 Main namespace.
 
 hpp::fcl
 
 hpp::fcl::detail
 

Functions

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. More...
 
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 More...
 
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 More...
 


hpp-fcl
Author(s):
autogenerated on Fri Jun 2 2023 02:39:02