Changeset 2292 for GTP/trunk/Lib/Vis/OnlineCullingCHC/src/RandomUpdateCullingManager.cpp

Timestamp:

03/26/07 18:49:17 (17 years ago)

Author:

mattausch

Message:

 

File:

• GTP/trunk/Lib/Vis/OnlineCullingCHC/src/RandomUpdateCullingManager.cpp (modified) (8 diffs)

GTP/trunk/Lib/Vis/OnlineCullingCHC/src/RandomUpdateCullingManager.cpp

@@ -2 +2 @@
 #include <time.h>
 #include "CullingLogManager.h"
+#include <vector>
+//#include <iostream>
+#include <sstream>
+
+
+using namespace std;
 
 
@@ -12 +18 @@
         SetAssumedVisibility(0);
         // initialise random generator in case we use assumed visibility
-        srand(time(NULL));
+        //srand(time(NULL));
 
         mRandomCandidates = R_CANDIDATES;
@@ -22 +28 @@
         SetAssumedVisibility(assumedVisibility);
         // initialise random generator in case we use assumed visibility
-        srand(time(NULL));
+        //srand(time(NULL));
 
         mRandomCandidates = R_CANDIDATES;
@@ -29 +35 @@
 void RandomUpdateCullingManager::RenderScene()
 {
-        CullingLogManager::GetSingleton()->LogMessage("ruc");
+        if (0) CullingLogManager::GetSingleton()->LogMessage("ruc");
 
         QueryQueue queryQueue;
@@ -37 +43 @@
         //-- PART 1: process finished occlusion queries
 
-        // update the fully visible classifications
-        mHierarchyInterface->DetermineFullVisibility(mHierarchyInterface->GetHierarchyRoot());
-
-        //mHierarchyInterface->TraverseNode2(mHierarchyInterface->GetHierarchyRoot());
-        
-#if 1
         while (!mHierarchyInterface->GetQueue()->empty() || !queryQueue.empty())
         {
@@ -121 +121 @@
                                 if (mHierarchyInterface->IsNodeFullyVisible(node))
                                 {
+#if 1
                                         // node fully visible => test only random leaves
                                         for (int i = 0; i < mRandomCandidates; ++ i)
@@ -138 +139 @@
                                                         mHierarchyInterface->IssueNodeOcclusionQuery(node)));
                                         }
-
-                                        mHierarchyInterface->TraverseNode2(node);
+#else
+                                        // test all leaves for visibility changes
+                                        HierarchyNodeContainer mynodes;
+                                        mHierarchyInterface->CollectLeaves(node, mynodes);
+
+                                        HierarchyNodeContainer::const_iterator nit, nit_end = mynodes.end();
+
+                                        for (nit = mynodes.begin(); nit != nit_end; ++ nit)
+                                        {
+                                                HierarchyNode *leaf = *nit;
+                                                mHierarchyInterface->SetNodeVisible(leaf, false);
+
+                                                // update node's visited flag
+                                                mHierarchyInterface->SetLastVisited(leaf, mHierarchyInterface->GetFrameId());
+
+                                                queryQueue.push(QueryPair(leaf, 
+                                                        mHierarchyInterface->IssueNodeOcclusionQuery(node)));
+                                        }
+#endif
+                                        mHierarchyInterface->RenderNodeRecursive(node);
 
                                         continue;
@@ -173 +192 @@
                 }
         }
-#endif
+
         //while (!mHierarchyInterface->GetQueue()->empty())
         //      mHierarchyInterface->GetQueue()->pop();
-        
+
+        // update the fully visible classifications
+        // TODO: this should be done during traversal!
+        mHierarchyInterface->DetermineFullVisibility(mHierarchyInterface->GetHierarchyRoot());
 }
 //-----------------------------------------------------------------------