#include <rsdl_kd_tree.h>
Definition at line 11 of file rsdl_kd_tree.h.
Public Member Functions | |
| rsdl_kd_node (const rsdl_bounding_box &outer_box, const rsdl_bounding_box &inner_box, unsigned int depth) | |
| ctor for internal node. | |
| rsdl_kd_node (const rsdl_bounding_box &outer_box, const rsdl_bounding_box &inner_box, unsigned int depth, const vcl_vector< int > &indices) | |
| ctor for leaf node. | |
Public Attributes | |
| rsdl_bounding_box | outer_box_ |
| outer bounding box in both cartesian and angular dimensions. | |
| rsdl_bounding_box | inner_box_ |
| inner bounding box in both cartesian and angular dimensions. | |
| unsigned int | depth_ |
| depth of node in the tree. | |
| vcl_vector< int > | point_indices_ |
| indices of the points stored at this leaf. | |
| rsdl_kd_node * | left_ |
| left child. | |
| rsdl_kd_node * | right_ |
| right child. | |
|
||||||||||||||||
|
ctor for internal node.
Definition at line 15 of file rsdl_kd_tree.h. |
|
||||||||||||||||||||
|
ctor for leaf node.
Definition at line 22 of file rsdl_kd_tree.h. |
|
|
depth of node in the tree.
Definition at line 34 of file rsdl_kd_tree.h. |
|
|
inner bounding box in both cartesian and angular dimensions.
Definition at line 32 of file rsdl_kd_tree.h. |
|
|
left child.
Definition at line 38 of file rsdl_kd_tree.h. |
|
|
outer bounding box in both cartesian and angular dimensions.
Definition at line 30 of file rsdl_kd_tree.h. |
|
|
indices of the points stored at this leaf.
Definition at line 36 of file rsdl_kd_tree.h. |
|
|
right child.
Definition at line 40 of file rsdl_kd_tree.h. |
1.4.4