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