|
Point Cloud Library (PCL)
1.15.1-dev
|
#include <pcl/recognition/ransac_based/bvh.h>
Collaboration diagram for pcl::recognition::BVH< UserData >::Node:Public Member Functions | |
| Node (std::vector< BoundedObject * > &sorted_objects, int first_id, int last_id) | |
| 'sorted_objects' is a sorted vector of bounded objects. More... | |
| virtual | ~Node () |
| bool | hasChildren () const |
| Node * | getLeftChild () |
| Node * | getRightChild () |
| BoundedObject * | getObject () |
| bool | isLeaf () const |
| bool | intersect (const float box[6]) const |
| Returns true if 'box' intersects or touches (with a side or a vertex) this node. More... | |
| double | computeBoundingBoxVolume () const |
| Computes and returns the volume of the bounding box of this node. More... | |
Protected Attributes | |
| float | bounds_ [6] |
| Node * | children_ [2] |
| BoundedObject * | object_ |
Friends | |
| class | BVH |
|
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 125 of file bvh.h.
References pcl::recognition::aux::expandBoundingBox().
|
inlinevirtual |
|
inline |
|
inline |
Definition at line 166 of file bvh.h.
Referenced by pcl::recognition::BVH< UserData >::intersect().
|
inline |
Definition at line 178 of file bvh.h.
Referenced by pcl::recognition::BVH< UserData >::intersect().
|
inline |
Definition at line 172 of file bvh.h.
Referenced by pcl::recognition::BVH< UserData >::intersect().
|
inline |
Definition at line 160 of file bvh.h.
Referenced by pcl::recognition::BVH< UserData >::intersect().
|
inline |
Returns true if 'box' intersects or touches (with a side or a vertex) this node.
Definition at line 191 of file bvh.h.
Referenced by pcl::recognition::BVH< UserData >::intersect().
|
inline |
|
protected |
|
protected |
|
protected |