Basic Box tree structure.  
 More...
#include <btGImpactQuantizedBvh.h>
Basic Box tree structure. 
Definition at line 36 of file btGImpactQuantizedBvh.h.
◆ btQuantizedBvhTree()
  
  | 
        
          | btQuantizedBvhTree::btQuantizedBvhTree | ( |  | ) |  |  | inline | 
 
 
◆ _build_sub_tree()
  
  | 
        
          | void btQuantizedBvhTree::_build_sub_tree | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes, |  
          |  |  | int | startIndex, |  
          |  |  | int | endIndex |  
          |  | ) |  |  |  | protected | 
 
 
◆ _calc_splitting_axis()
  
  | 
        
          | int btQuantizedBvhTree::_calc_splitting_axis | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes, |  
          |  |  | int | startIndex, |  
          |  |  | int | endIndex |  
          |  | ) |  |  |  | protected | 
 
 
◆ _sort_and_calc_splitting_index()
  
  | 
        
          | int btQuantizedBvhTree::_sort_and_calc_splitting_index | ( | GIM_BVH_DATA_ARRAY & | primitive_boxes, |  
          |  |  | int | startIndex, |  
          |  |  | int | endIndex, |  
          |  |  | int | splitAxis |  
          |  | ) |  |  |  | protected | 
 
 
◆ build_tree()
◆ calc_quantization()
◆ clearNodes()
  
  | 
        
          | void btQuantizedBvhTree::clearNodes | ( |  | ) |  |  | inline | 
 
 
◆ get_node_pointer()
◆ getEscapeNodeIndex()
  
  | 
        
          | int btQuantizedBvhTree::getEscapeNodeIndex | ( | int | nodeindex | ) | const |  | inline | 
 
 
◆ getLeftNode()
  
  | 
        
          | int btQuantizedBvhTree::getLeftNode | ( | int | nodeindex | ) | const |  | inline | 
 
 
◆ getNodeBound()
  
  | 
        
          | void btQuantizedBvhTree::getNodeBound | ( | int | nodeindex, |  
          |  |  | btAABB & | bound |  
          |  | ) |  | const |  | inline | 
 
 
◆ getNodeCount()
  
  | 
        
          | int btQuantizedBvhTree::getNodeCount | ( |  | ) | const |  | inline | 
 
 
◆ getNodeData()
  
  | 
        
          | int btQuantizedBvhTree::getNodeData | ( | int | nodeindex | ) | const |  | inline | 
 
 
◆ getRightNode()
  
  | 
        
          | int btQuantizedBvhTree::getRightNode | ( | int | nodeindex | ) | const |  | inline | 
 
 
◆ isLeafNode()
  
  | 
        
          | bool btQuantizedBvhTree::isLeafNode | ( | int | nodeindex | ) | const |  | inline | 
 
 
◆ quantizePoint()
  
  | 
        
          | void btQuantizedBvhTree::quantizePoint | ( | unsigned short * | quantizedpoint, |  
          |  |  | const btVector3 & | point |  
          |  | ) |  | const |  | inline | 
 
 
◆ setNodeBound()
  
  | 
        
          | void btQuantizedBvhTree::setNodeBound | ( | int | nodeindex, |  
          |  |  | const btAABB & | bound |  
          |  | ) |  |  |  | inline | 
 
 
◆ testQuantizedBoxOverlapp()
  
  | 
        
          | bool btQuantizedBvhTree::testQuantizedBoxOverlapp | ( | int | node_index, |  
          |  |  | unsigned short * | quantizedMin, |  
          |  |  | unsigned short * | quantizedMax |  
          |  | ) |  | const |  | inline | 
 
 
◆ m_bvhQuantization
  
  | 
        
          | btVector3 btQuantizedBvhTree::m_bvhQuantization |  | protected | 
 
 
◆ m_global_bound
  
  | 
        
          | btAABB btQuantizedBvhTree::m_global_bound |  | protected | 
 
 
◆ m_node_array
◆ m_num_nodes
  
  | 
        
          | int btQuantizedBvhTree::m_num_nodes |  | protected | 
 
 
The documentation for this class was generated from the following files: