BTPNode< BV, PRIM > Class Template Reference

this node class stores the bv implicitly and use explicit pointers to its child nodes. This is an inefficient storage method and for general usage the other types should be used. However, there is only a small overhead for adding and deleting nodes so for very dynamic uses this might still be applicable. More...

#include <BinaryBVTree.hpp>

Classes
class	NodeIterator
	an iterator for the PtrNode More...

Public Types
typedef BV	BVType
typedef PRIM	PRIMType

Public Member Functions
	BTPNode (const BV &bv)
BV &	bv ()
	get the OBB of this node
size_t &	primIdx ()
int	nrOfPrims ()
void	setNrOfPrims (int size)
BTPNode *	left ()
BTPNode *	right ()
void	setLeft (BTPNode *left)
void	setRight (BTPNode *right)
bool	isLeaf ()

Detailed Description

template<class BV, class PRIM>
class rw::proximity::BTPNode< BV, PRIM >

this node class stores the bv implicitly and use explicit pointers to its child nodes. This is an inefficient storage method and for general usage the other types should be used. However, there is only a small overhead for adding and deleting nodes so for very dynamic uses this might still be applicable.

---

The documentation for this class was generated from the following file:

• BinaryBVTree.hpp