Changeset 3052 for GTP/trunk/App/Demos/Vis/FriendlyCulling/src/BvhLoader.cpp

Timestamp:

10/21/08 03:55:43 (16 years ago)

Author:

mattausch

Message:

 

File:

• GTP/trunk/App/Demos/Vis/FriendlyCulling/src/BvhLoader.cpp (modified) (1 diff)

GTP/trunk/App/Demos/Vis/FriendlyCulling/src/BvhLoader.cpp

@@ -76 +76 @@
         BvhNode *root = LoadNextNode(stream, NULL);
 
-#if 1
+#if 0
 
         bvh->mRoot = root;
 
 #else
-        // copy root and set new one for dynamic objects
+        // we are setting a new root node
+        // which adds one level of indirection to the bvh but 
+        // allows us to use dynamic objects
+        // the new bvh has two main branches
+        // one is the static branch (the old root),
+        // one is the dynamic branch 
+        // we create a 'dynamic' leaf which basically is a container
+        // for all dynamic objects underneath
+        // the bounding boxes of the dynamic tree must be updated
+        // once each frame in order to be able to incorporate
+        // the movements of the objects within
+
         BvhInterior *newRoot = new BvhInterior(NULL);
-        
+        bvh->mRoot = newRoot;
+
+        BvhLeaf *dynamicLeaf = new BvhLeaf(newRoot);
+
+        newRoot->mFront = root;
+        newRoot->mBack = dynamicLeaf;
+        root->mParent = newRoot;
+
+        // the separation is a purely logical one
+        // the bounding boxes of the child nodes is the
+        // same as for the root node
         newRoot->mBox = root->mBox;
+        dynamicLeaf->mBox = root->mBox;
+
+        newRoot->mArea = newRoot->mBox.SurfaceArea();
+        dynamicLeaf->mArea = dynamicLeaf->mBox.SurfaceArea();
+
         newRoot->mFirst = root->mFirst;
         newRoot->mLast = root->mLast;
 
-        // create 'dynamic' leaf which basically is a container
-        // for all dynamic objects
-        BvhLeaf *dynamicLeaf = new BvhLeaf(newRoot);
-        dynamicLeaf->mBox = root->mBox;
-
-        newRoot->mFront = root;
-        root->mParent = newRoot;
-
-        newRoot->mBack = dynamicLeaf;
-
-        bvh->mRoot = newRoot;
+        dynamicLeaf->mFirst = 0;
+        dynamicLeaf->mLast = 0;
 #endif
 
-        tQueue.push(bvh->mRoot);
+        tQueue.push(root);
         bvh->mNumNodes = 1;