btQuantizedBvh

type btQuantizedBvh = class

public

type

  btTraversalMode = (

  TRAVERSAL_STACKLESS = 0,

  TRAVERSAL_STACKLESS_CACHE_FRIENDLY,

  TRAVERSAL_RECURSIVE

);

protected

  m_bvhAabbMin: btVector3;

  m_bvhAabbMax: btVector3;

  m_bvhQuantization: btVector3;

  m_bulletVersion: Integer;

  m_curNodeIndex: Integer;

  m_useQuantization: Boolean;

  m_leafNodes: btNodeArray;

  m_contiguousNodes: btNodeArray;

  m_quantizedLeafNodes: btQuantizedNodeArray;

  m_quantizedContiguousNodes: btQuantizedNodeArray;

  m_traversalMode: btTraversalMode;

  m_SubtreeHeaders: btBvhSubtreeInfoArray;

  m_subtreeHeaderCount: Integer;

  procedure setInternalNodeAabbMin();

  procedure setInternalNodeAabbMax();

  function getAabbMin();

  function getAabbMax();

  procedure setInternalNodeEscapeIndex();

  procedure mergeInternalNodeAabb();

  procedure swapLeafNodes();

  procedure assignInternalNodeFromLeafNode();

  procedure buildTree();

  function calcSplittingAxis();

  function sortAndCalcSplittingIndex();

  procedure walkStacklessTree();

  procedure walkStacklessQuantizedTreeAgainstRay();

  procedure walkStacklessQuantizedTree();

  procedure walkStacklessTreeAgainstRay();

  procedure walkStacklessQuantizedTreeCacheFriendly();

  procedure walkRecursiveQuantizedTreeAgainstQueryAabb();

  procedure updateSubtreeHeaders();

public

  constructor create;

  procedure setQuantizationValues();

  function getLeafNodeArray;

  procedure buildInternal;

  procedure reportAabbOverlappingNodex();

  procedure reportRayOverlappingNodex();

  procedure reportBoxCastOverlappingNodex();

  procedure quantize();

  procedure quantizeWithClamp();

  function unQuantize();

  procedure setTraversalMode();

  function getQuantizedNodeArray;

  function getSubtreeInfoArray;

  function isQuantized;

end;

btQuantizedBvh

TObject