$search
A class describing a bounding volume node. More...
#include <BVH_model.h>
Public Member Functions | |
BVH_REAL | distance (const BVNode &other) const |
bool | isLeaf () |
Whether current node is a leaf node (i.e. contains a primitive index. | |
int | leftChild () |
Return the index of the first child. The index is referred to the bounding volume array (i.e. bvs) in BVHModel. | |
bool | overlap (const BVNode &other) const |
Check whether two BVNode collide. | |
int | primitiveId () |
Return the primitive index. The index is referred to the original data (i.e. vertices or tri_indices) in BVHModel. | |
int | rightChild () |
Return the index of the second child. The index is referred to the bounding volume array (i.e. bvs) in BVHModel. | |
Public Attributes | |
BV | bv |
A bounding volume. | |
int | first_child |
An index for first child node or primitive If the value is positive, it is the index of the first child bv node If the value is negative, it is -(primitive index + 1) Zero is not used. | |
int | first_primitive |
The start id the primitive belonging to the current node. The index is referred to the primitive_indices in BVHModel and from that we can obtain the primitive's index in original data indirectly. | |
int | num_primitives |
The number of primitives belonging to the current node. |
A class describing a bounding volume node.
Definition at line 57 of file BVH_model.h.
BVH_REAL collision_checking::BVNode< BV >::distance | ( | const BVNode< BV > & | other | ) | const [inline] |
Definition at line 95 of file BVH_model.h.
bool collision_checking::BVNode< BV >::isLeaf | ( | ) | [inline] |
Whether current node is a leaf node (i.e. contains a primitive index.
Definition at line 78 of file BVH_model.h.
int collision_checking::BVNode< BV >::leftChild | ( | ) | [inline] |
Return the index of the first child. The index is referred to the bounding volume array (i.e. bvs) in BVHModel.
Definition at line 84 of file BVH_model.h.
bool collision_checking::BVNode< BV >::overlap | ( | const BVNode< BV > & | other | ) | const [inline] |
Check whether two BVNode collide.
Definition at line 90 of file BVH_model.h.
int collision_checking::BVNode< BV >::primitiveId | ( | ) | [inline] |
Return the primitive index. The index is referred to the original data (i.e. vertices or tri_indices) in BVHModel.
Definition at line 81 of file BVH_model.h.
int collision_checking::BVNode< BV >::rightChild | ( | ) | [inline] |
Return the index of the second child. The index is referred to the bounding volume array (i.e. bvs) in BVHModel.
Definition at line 87 of file BVH_model.h.
BV collision_checking::BVNode< BV >::bv |
A bounding volume.
Definition at line 60 of file BVH_model.h.
int collision_checking::BVNode< BV >::first_child |
An index for first child node or primitive If the value is positive, it is the index of the first child bv node If the value is negative, it is -(primitive index + 1) Zero is not used.
Definition at line 67 of file BVH_model.h.
int collision_checking::BVNode< BV >::first_primitive |
The start id the primitive belonging to the current node. The index is referred to the primitive_indices in BVHModel and from that we can obtain the primitive's index in original data indirectly.
Definition at line 72 of file BVH_model.h.
int collision_checking::BVNode< BV >::num_primitives |
The number of primitives belonging to the current node.
Definition at line 75 of file BVH_model.h.