ntree_traverser.h File Reference

#include <algorithm>
#include <utility>
#include <vector>
#include "ntree_traversal.h"

Go to the source code of this file.

Classes
struct	ug::RayElemIntersectionRecord< TElem >
class	ug::Traverser_FindContainingElement< tree_t >
class	ug::Traverser_FindElementsInIntersectingNodes< tree_t >
class	ug::Traverser_FindLowestLeafNodeLevel< tree_t >
class	ug::Traverser_MinMaxNumElements< tree_t >
	returns the minimum and maximum number of elements in all subtrees of nodes of the given level More...
class	ug::Traverser_RayElementIntersection< tree_t >

Namespaces
	ug
	the ug namespace

Functions
template<class tree_t >
bool	ug::FindContainingElement (typename tree_t::elem_t &elemOut, const tree_t &tree, const typename tree_t::vector_t &point)
template<class tree_t >
bool	ug::FindElementsInIntersectingNodes (std::vector< typename tree_t::elem_t > &elemsOut, const tree_t &tree, const typename tree_t::box_t &bbox)
template<class tree_t >
size_t	ug::FindLowestLeafNodeLevel (const tree_t &tree)
template<class tree_t >
std::pair< size_t, size_t >	ug::GetMinMaxNumElements (const tree_t &tree, size_t lvl)
template<class tree_t >
bool	ug::RayElementIntersections (std::vector< RayElemIntersectionRecord< typename tree_t::elem_t > > &intersectionsOut, const tree_t &tree, const typename tree_t::vector_t &rayFrom, const typename tree_t::vector_t &rayDir, const number small=1.e-12)