#include <bih_node.hh>
Definition at line 26 of file bih_node.hh.
unsigned int BIHNode::axis |
( |
| ) |
const |
|
inline |
return axes (coordination of splitting) of inner node
Definition at line 91 of file bih_node.hh.
double BIHNode::bound |
( |
| ) |
const |
|
inline |
unsigned int BIHNode::child |
( |
unsigned int |
i_child | ) |
const |
|
inline |
Return index of child node.
Definition at line 103 of file bih_node.hh.
unsigned char BIHNode::depth |
( |
| ) |
const |
|
inline |
return depth of leaf node
Definition at line 61 of file bih_node.hh.
bool BIHNode::is_leaf |
( |
| ) |
const |
|
inline |
return true if node is leaf
Definition at line 56 of file bih_node.hh.
unsigned int BIHNode::leaf_begin |
( |
| ) |
const |
|
inline |
unsigned int BIHNode::leaf_end |
( |
| ) |
const |
|
inline |
unsigned int BIHNode::leaf_size |
( |
| ) |
const |
|
inline |
Get count of elements stored in
- Returns
- Count of elements contained in node
Definition at line 84 of file bih_node.hh.
void BIHNode::set_depth |
( |
unsigned int |
depth | ) |
|
|
inlineprivate |
Set depth of node to axes_ class members
- Parameters
-
depth | Depth of node in tree. |
Definition at line 118 of file bih_node.hh.
void BIHNode::set_leaf |
( |
unsigned int |
begin, |
|
|
unsigned int |
end, |
|
|
double |
bound, |
|
|
unsigned int |
depth |
|
) |
| |
|
inline |
void BIHNode::set_non_leaf |
( |
unsigned int |
left, |
|
|
unsigned int |
right, |
|
|
unsigned int |
axis |
|
) |
| |
|
inline |
unsigned char BIHNode::axis_ |
|
private |
Value stores coordination of splitting area for inner nodes or depth for leaf nodes
- values 0,1,2 indicate inner node of tree and coordination of splitting area
- values 3 and greater indicate leaf node of tree and store depth of node (depth = axes_ - 3)
Definition at line 137 of file bih_node.hh.
A non-leaf node has two childs (left and right). Their bounding boxes are created from the bounding box of parent so that in one direction the left child set max to its bound_ and the right child set its min to bound_. This way we can always repcreate bounding box of every node when traversing the tree from the root.
Definition at line 130 of file bih_node.hh.
const unsigned int BIHNode::child_count = 2 |
|
static |
count of subareas - don't change
Definition at line 30 of file bih_node.hh.
const unsigned char BIHNode::dimension = 3 |
|
static |
The documentation for this class was generated from the following file: