pcl::recognition::BVH< UserData >::Node Class Reference

#include <bvh.h>

List of all members.

Public Member Functions
double	computeBoundingBoxVolume () const
	Computes and returns the volume of the bounding box of this node.
Node *	getLeftChild ()
BoundedObject *	getObject ()
Node *	getRightChild ()
bool	hasChildren () const
bool	intersect (const float box[6]) const
	Returns true if 'box' intersects or touches (with a side or a vertex) this node.
bool	isLeaf () const
	Node (std::vector< BoundedObject * > &sorted_objects, int first_id, int last_id)
	'sorted_objects' is a sorted vector of bounded objects. It has to be sorted in ascending order according to the objects' x-coordinates. The constructor recursively calls itself with the right 'first_id' and 'last_id' and with the same vector 'sorted_objects'.
virtual	~Node ()
Protected Attributes
float	bounds_ [6]
Node *	children_ [2]
BoundedObject *	object_
Friends
class	BVH

---

Detailed Description

template<class UserData>
class pcl::recognition::BVH< UserData >::Node

Definition at line 122 of file bvh.h.

---

Constructor & Destructor Documentation

template<class UserData >

pcl::recognition::BVH< UserData >::Node::Node	(	std::vector< BoundedObject * > &	sorted_objects,
		int	first_id,
		int	last_id
	)		[inline]

'sorted_objects' is a sorted vector of bounded objects. It has to be sorted in ascending order according to the objects' x-coordinates. The constructor recursively calls itself with the right 'first_id' and 'last_id' and with the same vector 'sorted_objects'.

Definition at line 128 of file bvh.h.

template<class UserData >

virtual pcl::recognition::BVH< UserData >::Node::~Node

(

)

[inline, virtual]

Definition at line 153 of file bvh.h.

---

Member Function Documentation

template<class UserData >

double pcl::recognition::BVH< UserData >::Node::computeBoundingBoxVolume

(

)

const [inline]

Computes and returns the volume of the bounding box of this node.

Definition at line 205 of file bvh.h.

template<class UserData >

Node* pcl::recognition::BVH< UserData >::Node::getLeftChild

(

)

[inline]

Definition at line 169 of file bvh.h.

template<class UserData >

BoundedObject* pcl::recognition::BVH< UserData >::Node::getObject

(

)

[inline]

Definition at line 181 of file bvh.h.

template<class UserData >

Node* pcl::recognition::BVH< UserData >::Node::getRightChild

(

)

[inline]

Definition at line 175 of file bvh.h.

template<class UserData >

bool pcl::recognition::BVH< UserData >::Node::hasChildren

(

)

const [inline]

Definition at line 163 of file bvh.h.

template<class UserData >

bool pcl::recognition::BVH< UserData >::Node::intersect

(

const float

box[6]

)

const [inline]

Returns true if 'box' intersects or touches (with a side or a vertex) this node.

Definition at line 194 of file bvh.h.

template<class UserData >

bool pcl::recognition::BVH< UserData >::Node::isLeaf

(

)

const [inline]

Definition at line 187 of file bvh.h.

---

Friends And Related Function Documentation

template<class UserData >

friend class BVH [friend]

Definition at line 210 of file bvh.h.

---

Member Data Documentation

template<class UserData >

float pcl::recognition::BVH< UserData >::Node::bounds_[6] [protected]

Definition at line 213 of file bvh.h.

template<class UserData >

Node* pcl::recognition::BVH< UserData >::Node::children_[2] [protected]

Definition at line 214 of file bvh.h.

template<class UserData >

BoundedObject* pcl::recognition::BVH< UserData >::Node::object_ [protected]

Definition at line 215 of file bvh.h.

---

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

• bvh.h