Changeset 1687 for GTP/trunk/Lib/Vis/Preprocessing/src/BvHierarchy.cpp

Timestamp:

10/27/06 10:39:58 (18 years ago)

Author:

mattausch

Message:

 

File:

• GTP/trunk/Lib/Vis/Preprocessing/src/BvHierarchy.cpp (modified) (5 diffs)

GTP/trunk/Lib/Vis/Preprocessing/src/BvHierarchy.cpp

@@ -415 +415 @@
         backData.mMaxCostMisses = sc.GetMaxCostMisses();
         
-        //node->mRenderCostDecr = sc.GetRenderCostDecrease();
-        //node->mPvsEntriesIncr = sc.GetPvsEntriesIncr();
-
+        // set the time stamp so the order of traversal can be reconstructed
+        node->mTimeStamp = mHierarchyManager->mTimeStamp ++;
+                
         // assign the objects in sorted order
         if (mUseGlobalSorting)
@@ -449 +449 @@
                 currentNode = SubdivideNode(*sc, tFrontData, tBackData);
         
-                // set the time stamp so the order of traversal can be reconstructed
-                currentNode->mTimeStamp = mHierarchyManager->mTimeStamp ++;
-                //currentNode->mRenderCostDecr = sc.GetRenderCostDecrease();
-                //currentNode->mPvsEntriesIncr = sc.GetPvsEntriesIncr();
-
                 // decrease the weighted average cost of the subdivisoin
                 mTotalCost -= sc->GetRenderCostDecrease();
@@ -899 +894 @@
                         // (as we are not sampling volumetric visibility,
                         // this should provide better heuristics
-                        const float area = //obox.SurfaceArea();
+                        const float area = obj->GetArea();//obox.SurfaceArea();
 
                         al += area;
@@ -2141 +2136 @@
                 currentNode = SubdivideNode(*sc, tFrontData, tBackData);
         
-                currentNode->mRenderCostDecr = oldNode->mRenderCostDecr + sc->GetRenderCostDecrease();
-                currentNode->mPvsEntriesIncr = oldNode->mPvsEntriesIncr + sc->GetPvsEntriesIncr();
-
+                oldNode->mRenderCostDecr += sc->GetRenderCostDecrease();
+                oldNode->mPvsEntriesIncr += sc->GetPvsEntriesIncr();
+cout << "here5" << endl;
                 ///////////////////////////
                 //-- push the new split candidates on the queue
@@ -2151 +2146 @@
 
                 frontCandidate->SetPriority((float)-oldInterior->GetFront()->mTimeStamp);
-                backCandidate->SetPriority((float)-oldInterior->GetFront()->mTimeStamp);
+                backCandidate->SetPriority((float)-oldInterior->GetBack()->mTimeStamp);
 
                 frontCandidate->mEvaluationHack = oldInterior->GetFront();