Changeset 608 for trunk/VUT/GtpVisibilityPreprocessor/src/ViewCell.cpp

Timestamp:

02/08/06 20:32:42 (18 years ago)

Author:

bittner

Message:

slider support for viewcells

File:

• trunk/VUT/GtpVisibilityPreprocessor/src/ViewCell.cpp (modified) (4 diffs)

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCell.cpp

@@ -606 +606 @@
                         if (mViewCellsManager->EqualToSpatialNode(mergedVc))
                                 ++ mergeStats.siblings;
+                        mergedVc->SetCost(realExpectedCost);
 
                         if (((mergeStats.merged % statsOut) == 0) || 
@@ -664 +665 @@
                 ViewCellInterior *root = mViewCellsManager->MergeViewCells(activeViewCells);
                 root->SetMergeCost(totalRenderCost);
+                // $$JB keep this 0 temporarilly
+                root->SetCost(0.0f);
+                
                 mRoot = root;
         }
@@ -693 +697 @@
         Debug << mergeStats << endl << endl;
 
-
+        // assign colors for the view cells so that at least one is always consistent
+        AssignRandomColors();
         //TODO: should return sample contributions?
         return mergeStats.merged;
@@ -1533 +1538 @@
 
 
+void
+ViewCellsTree::AssignRandomColors()
+{
+  TraversalQueue tqueue;
+  tqueue.push(mRoot);
+  mRoot->SetColor(RandomColor(0.3f, 1.0f));
+  while (!tqueue.empty())
+        {
+          ViewCell *vc = tqueue.top();
+          
+          // save the view cells if it is a leaf or if enough view cells have already been traversed
+          // because of the priority queue, this will be the optimal set of v
+          if (!vc->IsLeaf()) {  
+                ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
+                
+                ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
+                float maxProbability = -1.0f;
+                ViewCell *maxViewCell = NULL;
+                for (it = interior->mChildren.begin(); it != it_end; ++ it) {
+                  ViewCell *v = *it;
+                  // set random color
+                  v->SetColor(RandomColor(0.3f, 1.0f));
+                  if (v->GetVolume() > maxProbability) {
+                        maxProbability = v->GetVolume();
+                        maxViewCell = v;
+                  }
+                  maxViewCell->SetColor(vc->GetColor());
+                  tqueue.push(v);
+                }
+                
+          }
+          
+          tqueue.pop();
+        }
+}
+
+/** Get costs resulting from each merge step. */
+void
+ViewCellsTree::GetCostFunction(vector<float> &costFunction)
+{
+  TraversalQueue tqueue;
+  tqueue.push(mRoot);
+  while (!tqueue.empty()) {
+        ViewCell *vc = tqueue.top();
+        
+        // save the view cells if it is a leaf or if enough view cells have already been traversed
+        // because of the priority queue, this will be the optimal set of v
+        if (!vc->IsLeaf()) {    
+          ViewCellInterior *interior = dynamic_cast<ViewCellInterior *>(vc);
+          costFunction.push_back(interior->GetCost());
+          
+          ViewCellContainer::const_iterator it, it_end = interior->mChildren.end();
+          
+          for (it = interior->mChildren.begin(); it != it_end; ++ it) {
+                tqueue.push(*it);
+          }
+          
+        }
+        
+        tqueue.pop();
+  }
+}
+
+
 void  ViewCellsTree::UpdateViewCellsStats(ViewCell *vc, ViewCellsStatistics &vcStat)
 {