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

Timestamp:

09/27/06 19:23:51 (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

@@ -489 +489 @@
         const float renderCostDecr = oldRenderCost - newRenderCost;
 
-//#ifdef _DEBUG
+#ifdef _DEBUG
         Debug << "old render cost: " << oldRenderCost << endl;
         Debug << "new render cost: " << newRenderCost << endl;
         Debug << "render cost decrease: " << renderCostDecr << endl;
-//#endif
+#endif
         splitCandidate.SetRenderCostDecrease(renderCostDecr);
 
@@ -527 +527 @@
                 (0
                 || (mBvhStats.Leaves() >= mTermMaxLeaves)
-                || (mBvhStats.mGlobalCostMisses >= mTermGlobalCostMissTolerance)
+                //|| (mBvhStats.mGlobalCostMisses >= mTermGlobalCostMissTolerance)
                 //|| mOutOfMemory 
                 );
@@ -974 +974 @@
 
 #ifdef _DEBUG
-        Debug << "\n§§§§ eval local cost §§§§" << endl
+        Debug << "\n§§§§ bvh eval const decrease §§§§" << endl
                   << "back pvs: " << (int)objectsBack.size() << " front pvs: " << (int)objectsFront.size() << " total pvs: " << nTotalObjects << endl 
                   << "back p: " << volBack / viewSpaceVol << " front p " << volFront / viewSpaceVol << " p: " << totalVol / viewSpaceVol << endl
@@ -1656 +1656 @@
                                                                                                            const ObjectContainer &objects)
 {
-        ///////////////////////////////////////////////////////////////
-        //-- note matt: we assume that we have objects sorted by their id => 
+        ///////////////////////////////////////
+        //-- we assume that we have objects sorted by their id => 
         //-- we don't have to sort them here and an binary search 
         //-- for identifying if a object is in a leaf.
@@ -1665 +1665 @@
 
         mBvhStats.nodes = 1;
-        
-        
+                
         // store pointer to this tree
         BvhSubdivisionCandidate::sBvHierarchy = this;