Bart/bullet3
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

allow incremental refitting of the quantized aabb tree

Browse Source
This commit is contained in:
ejcoumans
2007-04-10 21:40:43 +00:00
parent 853bafb7ae
commit 2cf026aae3
6 changed files with 153 additions and 55 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
src/BulletCollision/CollisionShapes/btOptimizedBvh.h
View File

@@ -201,9 +201,7 @@ ATTRIBUTE_ALIGNED16(class) btOptimizedBvh
}
void initQuantizationValues(btStridingMeshInterface* triangles);
void setQuantizationValues(const btVector3& bvhAabbMin,const btVector3& bvhAabbMax);
void setInternalNodeEscapeIndex(int nodeIndex, int escapeIndex)
{
@@ -287,7 +285,7 @@ public:
virtual ~btOptimizedBvh();
void build(btStridingMeshInterface* triangles,bool useQuantizedAabbCompression);
void build(btStridingMeshInterface* triangles,bool useQuantizedAabbCompression, const btVector3& bvhAabbMin, const btVector3& bvhAabbMax);
void reportAabbOverlappingNodex(btNodeOverlapCallback* nodeCallback,const btVector3& aabbMin,const btVector3& aabbMax) const;
@@ -305,6 +303,11 @@ public:
void refit(btStridingMeshInterface* triangles);
void refitPartial(btStridingMeshInterface* triangles,const btVector3& aabbMin, const btVector3& aabbMax);
void updateBvhNodes(btStridingMeshInterface* meshInterface,int firstNode,int endNode);
QuantizedNodeArray& getQuantizedNodeArray()
{
return m_quantizedContiguousNodes;