Basic Box tree structure. More...
#include <btGImpactBvh.h>
Public Member Functions | |
btBvhTree () | |
void | build_tree (GIM_BVH_DATA_ARRAY &primitive_boxes) |
SIMD_FORCE_INLINE void | clearNodes () |
SIMD_FORCE_INLINE int | getNodeCount () const |
node count | |
SIMD_FORCE_INLINE bool | isLeafNode (int nodeindex) const |
tells if the node is a leaf | |
SIMD_FORCE_INLINE int | getNodeData (int nodeindex) const |
SIMD_FORCE_INLINE void | getNodeBound (int nodeindex, btAABB &bound) const |
SIMD_FORCE_INLINE void | setNodeBound (int nodeindex, const btAABB &bound) |
SIMD_FORCE_INLINE int | getLeftNode (int nodeindex) const |
SIMD_FORCE_INLINE int | getRightNode (int nodeindex) const |
SIMD_FORCE_INLINE int | getEscapeNodeIndex (int nodeindex) const |
SIMD_FORCE_INLINE const GIM_BVH_TREE_NODE * | get_node_pointer (int index=0) const |
Protected Member Functions | |
void | _build_sub_tree (GIM_BVH_DATA_ARRAY &primitive_boxes, int startIndex, int endIndex) |
int | _calc_splitting_axis (GIM_BVH_DATA_ARRAY &primitive_boxes, int startIndex, int endIndex) |
int | _sort_and_calc_splitting_index (GIM_BVH_DATA_ARRAY &primitive_boxes, int startIndex, int endIndex, int splitAxis) |
Protected Attributes | |
GIM_BVH_TREE_NODE_ARRAY | m_node_array |
int | m_num_nodes |
Basic Box tree structure.
Definition at line 143 of file btGImpactBvh.h.
btBvhTree::btBvhTree | ( | ) | [inline] |
Definition at line 157 of file btGImpactBvh.h.
void btBvhTree::_build_sub_tree | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes, |
int | startIndex, | ||
int | endIndex | ||
) | [protected] |
int btBvhTree::_calc_splitting_axis | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes, |
int | startIndex, | ||
int | endIndex | ||
) | [protected] |
int btBvhTree::_sort_and_calc_splitting_index | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes, |
int | startIndex, | ||
int | endIndex, | ||
int | splitAxis | ||
) | [protected] |
void btBvhTree::build_tree | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes | ) |
prototype functions for box tree management
SIMD_FORCE_INLINE void btBvhTree::clearNodes | ( | ) | [inline] |
Definition at line 166 of file btGImpactBvh.h.
SIMD_FORCE_INLINE const GIM_BVH_TREE_NODE* btBvhTree::get_node_pointer | ( | int | index = 0 | ) | const [inline] |
Definition at line 215 of file btGImpactBvh.h.
SIMD_FORCE_INLINE int btBvhTree::getEscapeNodeIndex | ( | int | nodeindex | ) | const [inline] |
Definition at line 210 of file btGImpactBvh.h.
SIMD_FORCE_INLINE int btBvhTree::getLeftNode | ( | int | nodeindex | ) | const [inline] |
Definition at line 199 of file btGImpactBvh.h.
SIMD_FORCE_INLINE void btBvhTree::getNodeBound | ( | int | nodeindex, |
btAABB & | bound | ||
) | const [inline] |
Definition at line 189 of file btGImpactBvh.h.
SIMD_FORCE_INLINE int btBvhTree::getNodeCount | ( | ) | const [inline] |
node count
Definition at line 173 of file btGImpactBvh.h.
SIMD_FORCE_INLINE int btBvhTree::getNodeData | ( | int | nodeindex | ) | const [inline] |
Definition at line 184 of file btGImpactBvh.h.
SIMD_FORCE_INLINE int btBvhTree::getRightNode | ( | int | nodeindex | ) | const [inline] |
Definition at line 204 of file btGImpactBvh.h.
SIMD_FORCE_INLINE bool btBvhTree::isLeafNode | ( | int | nodeindex | ) | const [inline] |
tells if the node is a leaf
Definition at line 179 of file btGImpactBvh.h.
SIMD_FORCE_INLINE void btBvhTree::setNodeBound | ( | int | nodeindex, |
const btAABB & | bound | ||
) | [inline] |
Definition at line 194 of file btGImpactBvh.h.
GIM_BVH_TREE_NODE_ARRAY btBvhTree::m_node_array [protected] |
Definition at line 147 of file btGImpactBvh.h.
int btBvhTree::m_num_nodes [protected] |
Definition at line 146 of file btGImpactBvh.h.