Logo Search packages:      
Sourcecode: blender version File versions  Download package

btQuantizedBvhTree Class Reference

#include <btGImpactQuantizedBvh.h>

List of all members.


Detailed Description

Basic Box tree structure.

Definition at line 105 of file btGImpactQuantizedBvh.h.


Public Member Functions

void build_tree (GIM_BVH_DATA_ARRAY &primitive_boxes)
 stackless build tree
SIMD_FORCE_INLINE void clearNodes ()
SIMD_FORCE_INLINE const
BT_QUANTIZED_BVH_NODE * 
get_node_pointer (int index=0) const
SIMD_FORCE_INLINE int getEscapeNodeIndex (int nodeindex) const
SIMD_FORCE_INLINE int getLeftNode (int nodeindex) const
SIMD_FORCE_INLINE void getNodeBound (int nodeindex, btAABB &bound) const
SIMD_FORCE_INLINE int getNodeCount () const
 node count
SIMD_FORCE_INLINE int getNodeData (int nodeindex) const
SIMD_FORCE_INLINE int getRightNode (int nodeindex) const
SIMD_FORCE_INLINE bool isLeafNode (int nodeindex) const
 tells if the node is a leaf
SIMD_FORCE_INLINE void quantizePoint (unsigned short *quantizedpoint, const btVector3 &point) const
SIMD_FORCE_INLINE void setNodeBound (int nodeindex, const btAABB &bound)
SIMD_FORCE_INLINE bool testQuantizedBoxOverlapp (int node_index, unsigned short *quantizedMin, unsigned short *quantizedMax) 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

The documentation for this class was generated from the following files:

Generated by  Doxygen 1.6.0   Back to index