Basic Box tree structure. More...
#include <btGImpactQuantizedBvh.h>
Public Member Functions | |
btQuantizedBvhTree () | |
void | build_tree (GIM_BVH_DATA_ARRAY &primitive_boxes) |
SIMD_FORCE_INLINE void | quantizePoint (unsigned short *quantizedpoint, const btVector3 &point) const |
SIMD_FORCE_INLINE bool | testQuantizedBoxOverlapp (int node_index, unsigned short *quantizedMin, unsigned short *quantizedMax) const |
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 BT_QUANTIZED_BVH_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) |
void | calc_quantization (GIM_BVH_DATA_ARRAY &primitive_boxes, btScalar boundMargin=btScalar(1.0)) |
Protected Attributes | |
btVector3 | m_bvhQuantization |
btAABB | m_global_bound |
GIM_QUANTIZED_BVH_NODE_ARRAY | m_node_array |
int | m_num_nodes |
Basic Box tree structure.
Definition at line 105 of file btGImpactQuantizedBvh.h.
btQuantizedBvhTree::btQuantizedBvhTree | ( | ) | [inline] |
Definition at line 123 of file btGImpactQuantizedBvh.h.
void btQuantizedBvhTree::_build_sub_tree | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes, |
int | startIndex, | ||
int | endIndex | ||
) | [protected] |
int btQuantizedBvhTree::_calc_splitting_axis | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes, |
int | startIndex, | ||
int | endIndex | ||
) | [protected] |
int btQuantizedBvhTree::_sort_and_calc_splitting_index | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes, |
int | startIndex, | ||
int | endIndex, | ||
int | splitAxis | ||
) | [protected] |
void btQuantizedBvhTree::build_tree | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes | ) |
prototype functions for box tree management
void btQuantizedBvhTree::calc_quantization | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes, |
btScalar | boundMargin = btScalar(1.0) |
||
) | [protected] |
SIMD_FORCE_INLINE void btQuantizedBvhTree::clearNodes | ( | ) | [inline] |
Definition at line 146 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE const BT_QUANTIZED_BVH_NODE* btQuantizedBvhTree::get_node_pointer | ( | int | index = 0 | ) | const [inline] |
Definition at line 211 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE int btQuantizedBvhTree::getEscapeNodeIndex | ( | int | nodeindex | ) | const [inline] |
Definition at line 206 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE int btQuantizedBvhTree::getLeftNode | ( | int | nodeindex | ) | const [inline] |
Definition at line 195 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE void btQuantizedBvhTree::getNodeBound | ( | int | nodeindex, |
btAABB & | bound | ||
) | const [inline] |
Definition at line 169 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE int btQuantizedBvhTree::getNodeCount | ( | ) | const [inline] |
node count
Definition at line 153 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE int btQuantizedBvhTree::getNodeData | ( | int | nodeindex | ) | const [inline] |
Definition at line 164 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE int btQuantizedBvhTree::getRightNode | ( | int | nodeindex | ) | const [inline] |
Definition at line 200 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE bool btQuantizedBvhTree::isLeafNode | ( | int | nodeindex | ) | const [inline] |
tells if the node is a leaf
Definition at line 159 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE void btQuantizedBvhTree::quantizePoint | ( | unsigned short * | quantizedpoint, |
const btVector3 & | point | ||
) | const [inline] |
Definition at line 132 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE void btQuantizedBvhTree::setNodeBound | ( | int | nodeindex, |
const btAABB & | bound | ||
) | [inline] |
Definition at line 180 of file btGImpactQuantizedBvh.h.
SIMD_FORCE_INLINE bool btQuantizedBvhTree::testQuantizedBoxOverlapp | ( | int | node_index, |
unsigned short * | quantizedMin, | ||
unsigned short * | quantizedMax | ||
) | const [inline] |
Definition at line 139 of file btGImpactQuantizedBvh.h.
btVector3 btQuantizedBvhTree::m_bvhQuantization [protected] |
Definition at line 111 of file btGImpactQuantizedBvh.h.
btAABB btQuantizedBvhTree::m_global_bound [protected] |
Definition at line 110 of file btGImpactQuantizedBvh.h.
Definition at line 109 of file btGImpactQuantizedBvh.h.
int btQuantizedBvhTree::m_num_nodes [protected] |
Definition at line 108 of file btGImpactQuantizedBvh.h.