mitsuba::PointKDTree< _NodeType > Member List

This is the complete list of members for mitsuba::PointKDTree< _NodeType >, including all inherited members.

AABBType typedef	mitsuba::PointKDTree< _NodeType >
build(bool recomputeAABB=false)	mitsuba::PointKDTree< _NodeType >	inline
build(size_t depth, typename std::vector< IndexType >::iterator base, typename std::vector< IndexType >::iterator rangeStart, typename std::vector< IndexType >::iterator rangeEnd)	mitsuba::PointKDTree< _NodeType >	inlineprotected
buildLB(IndexType idx, size_t depth, typename std::vector< IndexType >::iterator base, typename std::vector< IndexType >::iterator rangeStart, typename std::vector< IndexType >::iterator rangeEnd, typename std::vector< IndexType > &permutation)	mitsuba::PointKDTree< _NodeType >	inlineprotected
capacity() const	mitsuba::PointKDTree< _NodeType >	inline
clear()	mitsuba::PointKDTree< _NodeType >	inline
EBalanced enum value	mitsuba::PointKDTree< _NodeType >
EHeuristic enum name	mitsuba::PointKDTree< _NodeType >
ELeftBalanced enum value	mitsuba::PointKDTree< _NodeType >
ESlidingMidpoint enum value	mitsuba::PointKDTree< _NodeType >
EVoxelVolume enum value	mitsuba::PointKDTree< _NodeType >
executeModifier(const PointType &p, Float searchRadius, Functor &functor)	mitsuba::PointKDTree< _NodeType >	inline
executeQuery(const PointType &p, Float searchRadius, Functor &functor) const	mitsuba::PointKDTree< _NodeType >	inline
getAABB() const	mitsuba::PointKDTree< _NodeType >	inline
getDepth() const	mitsuba::PointKDTree< _NodeType >	inline
hasRightChild(IndexType index) const	mitsuba::PointKDTree< _NodeType >	inline
IndexType typedef	mitsuba::PointKDTree< _NodeType >
leftSubtreeSize(IndexType count) const	mitsuba::PointKDTree< _NodeType >	inlineprotected
m_aabb	mitsuba::PointKDTree< _NodeType >	protected
m_depth	mitsuba::PointKDTree< _NodeType >	protected
m_heuristic	mitsuba::PointKDTree< _NodeType >	protected
m_nodes	mitsuba::PointKDTree< _NodeType >	protected
nnSearch(const PointType &p, Float &_sqrSearchRadius, size_t k, SearchResult *results) const	mitsuba::PointKDTree< _NodeType >	inline
nnSearch(const PointType &p, size_t k, SearchResult *results) const	mitsuba::PointKDTree< _NodeType >	inline
nnSearchCollectStatistics(const PointType &p, Float &sqrSearchRadius, size_t k, SearchResult *results, size_t &traversalSteps) const	mitsuba::PointKDTree< _NodeType >	inline
NodeType typedef	mitsuba::PointKDTree< _NodeType >
operator[](size_t idx)	mitsuba::PointKDTree< _NodeType >	inline
operator[](size_t idx) const	mitsuba::PointKDTree< _NodeType >	inline
PointKDTree(size_t nodes=0, EHeuristic heuristic=ESlidingMidpoint)	mitsuba::PointKDTree< _NodeType >	inline
PointType typedef	mitsuba::PointKDTree< _NodeType >
push_back(const NodeType &node)	mitsuba::PointKDTree< _NodeType >	inline
reserve(size_t size)	mitsuba::PointKDTree< _NodeType >	inline
resize(size_t size)	mitsuba::PointKDTree< _NodeType >	inline
Scalar typedef	mitsuba::PointKDTree< _NodeType >
search(const PointType &p, Float searchRadius, std::vector< IndexType > &results) const	mitsuba::PointKDTree< _NodeType >	inline
setAABB(const AABBType &aabb)	mitsuba::PointKDTree< _NodeType >	inline
setDepth(size_t depth)	mitsuba::PointKDTree< _NodeType >	inline
size() const	mitsuba::PointKDTree< _NodeType >	inline
VectorType typedef	mitsuba::PointKDTree< _NodeType >