Changeset 3068 for GTP/trunk/App/Demos/Vis/FriendlyCulling/src/Bvh.cpp

Timestamp:

10/24/08 16:39:24 (16 years ago)

Author:

mattausch

Message:

working on dynamic stuff again

File:

• GTP/trunk/App/Demos/Vis/FriendlyCulling/src/Bvh.cpp (modified) (7 diffs)

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

@@ -419 +419 @@
         if (!mDynamicEntities.empty())
         {
-                //UpdateDynamicBranch();
+                UpdateDynamicBranch();
         }
 }
@@ -427 +427 @@
 {
         // q: should we use distance to center rather than the distance to the near plane?
-        
-        // because otherwise problems with big object penetrating the near plane 
-        // (e.g., big objects in the distance which are then always visible)
-        // especially annoying is this problem when using the frustum 
-        // fitting on the visible objects for shadow mapping
-        // on the other hand, distance to near plane can also be used 
-        // for near plane intersection
-        node->mDistance = sNearPlane.Distance(node->GetBox().Center());
-        //node->mDistance = node->GetBox().GetMinDistance(sNearPlane);
+        // distance to near plane can also be used for checking near plane intersection
+        //node->mDistance = sNearPlane.Distance(node->GetBox().Center());
+        node->mDistance = node->GetBox().GetMinDistance(sNearPlane);
 }
 
@@ -441 +435 @@
 float Bvh::CalcMaxDistance(BvhNode *node) const
 {
+#if 1
         return node->GetBox().GetMaxDistance(sNearPlane);
 
+#else
+        // use bounding boxes of geometry to determine max dist
         float maxDist = .0f;
 
@@ -457 +454 @@
 
         return maxDist;
+#endif
 }
 
@@ -932 +930 @@
 
         mNumVirtualNodes = 0;
-
         // assign new virtual leaves based on specified #triangles per leaf
         std::stack<BvhNode *> nodeStack;
-
         nodeStack.push(mRoot);
 
@@ -1273 +1269 @@
 void Bvh::UpdateDynamicBranch()
 {
-        BvhNode *dynamicRoot = static_cast<BvhInterior *>(mRoot)->mBack;
-
         // delete old branch
-        if (!dynamicRoot->IsLeaf())
+        if (!mDynamicRoot->IsLeaf())
         {
                 cout << "deleting old branch" << endl;
 
-                DEL_PTR(dynamicRoot);
-
-                dynamicRoot = new BvhLeaf(mRoot);
-                dynamicRoot->mBox = mRoot->mBox;
+                DEL_PTR(mDynamicRoot);
+
+                mDynamicRoot = new BvhLeaf(mRoot);
+                mDynamicRoot->mBox = mRoot->mBox;
+
+                mDynamicRoot->mFirst = 0;
+                mDynamicRoot->mLast = 0;
+                mDynamicRoot->mArea = mDynamicRoot->mBox.SurfaceArea();
         }
 
         cout << "updating dynamic branch" << endl;
 
-        dynamicRoot = SubdivideLeaf(static_cast<BvhLeaf *>(dynamicRoot), 0, mDynamicEntities);
+        mDynamicRoot = SubdivideLeaf(static_cast<BvhLeaf *>(mDynamicRoot), 0, mDynamicEntities);
 
         cout << "finished updating dynamic branch" << endl;
@@ -1302 +1300 @@
 bool Bvh::IntersectsNearPlane(BvhNode *node) const
 { 
-        float distanceToNearPlane = node->GetBox().GetMinDistance(sNearPlane);
+        // note: we have problems with large scale object penetrating the near plane 
+        // (e.g., objects in the distance which are always handled to be visible)
+        // especially annoying is this problem when using the frustum 
+        // fitting on the visible objects for shadow mapping
+        // but don't see how to solve this issue without using much costlier calculations
+        
         // we stored the near plane distance => we can use it also here
-        //float distanceToNearPlane = node->GetDistance();
-        
-        return distanceToNearPlane < sNear;
-}
-
-
-}
+        float distanceToNearPlane = node->GetDistance();
+        //float distanceToNearPlane = node->GetBox().GetMinDistance(sNearPlane);
+        
+        return (distanceToNearPlane < sNear);
+}
+
+
+}