Basic Box tree structure.
More...
#include <btGImpactBvh.h>
Basic Box tree structure.
Definition at line 66 of file btGImpactBvh.h.
§ btBvhTree()
§ _build_sub_tree()
void btBvhTree::_build_sub_tree |
( |
GIM_BVH_DATA_ARRAY & |
primitive_boxes, |
|
|
int |
startIndex, |
|
|
int |
endIndex |
|
) |
| |
|
protected |
§ _calc_splitting_axis()
int btBvhTree::_calc_splitting_axis |
( |
GIM_BVH_DATA_ARRAY & |
primitive_boxes, |
|
|
int |
startIndex, |
|
|
int |
endIndex |
|
) |
| |
|
protected |
§ _sort_and_calc_splitting_index()
int btBvhTree::_sort_and_calc_splitting_index |
( |
GIM_BVH_DATA_ARRAY & |
primitive_boxes, |
|
|
int |
startIndex, |
|
|
int |
endIndex, |
|
|
int |
splitAxis |
|
) |
| |
|
protected |
§ build_tree()
prototype functions for box tree management
stackless build tree
Definition at line 212 of file btGImpactBvh.cpp.
§ clearNodes()
void btBvhTree::clearNodes |
( |
| ) |
|
|
inline |
§ get_node_pointer()
§ getEscapeNodeIndex()
int btBvhTree::getEscapeNodeIndex |
( |
int |
nodeindex | ) |
const |
|
inline |
§ getLeftNode()
int btBvhTree::getLeftNode |
( |
int |
nodeindex | ) |
const |
|
inline |
§ getNodeBound()
void btBvhTree::getNodeBound |
( |
int |
nodeindex, |
|
|
btAABB & |
bound |
|
) |
| const |
|
inline |
§ getNodeCount()
int btBvhTree::getNodeCount |
( |
| ) |
const |
|
inline |
§ getNodeData()
int btBvhTree::getNodeData |
( |
int |
nodeindex | ) |
const |
|
inline |
§ getRightNode()
int btBvhTree::getRightNode |
( |
int |
nodeindex | ) |
const |
|
inline |
§ isLeafNode()
bool btBvhTree::isLeafNode |
( |
int |
nodeindex | ) |
const |
|
inline |
§ setNodeBound()
void btBvhTree::setNodeBound |
( |
int |
nodeindex, |
|
|
const btAABB & |
bound |
|
) |
| |
|
inline |
§ m_node_array
§ m_num_nodes
int btBvhTree::m_num_nodes |
|
protected |
The documentation for this class was generated from the following files: