Changeset 191 for trunk/VUT/GtpVisibilityPreprocessor/src/KdTree.cpp

Timestamp:

08/03/05 11:15:30 (19 years ago)

Author:

bittner

Message:

basic sampling strategies

File:

• trunk/VUT/GtpVisibilityPreprocessor/src/KdTree.cpp (modified) (1 diff)

trunk/VUT/GtpVisibilityPreprocessor/src/KdTree.cpp

@@ -710 +710 @@
   return neighbors.size();
 }
+
+void
+KdTree::CollectLeaves(vector<KdLeaf *> &leaves)
+{
+  stack<KdNode *> nodeStack;
+  nodeStack.push(mRoot);
+
+  while (!nodeStack.empty()) {
+    KdNode *node = nodeStack.top();
+    nodeStack.pop();
+    if (node->IsLeaf()) {
+      KdLeaf *leaf = (KdLeaf *)node;
+      leaves.push_back(leaf);
+    } else {
+      KdInterior *interior = (KdInterior *)node;
+      nodeStack.push(interior->mBack);
+      nodeStack.push(interior->mFront);
+    }
+  }
+}
+
+
+int
+KdTree::CollectLeafPvs()
+{
+  int totalPvsSize = 0;
+  stack<KdNode *> nodeStack;
+  
+  nodeStack.push(mRoot);
+  
+  while (!nodeStack.empty()) {
+    KdNode *node = nodeStack.top();
+    nodeStack.pop();
+    if (node->IsLeaf()) {
+      KdLeaf *leaf = (KdLeaf *)node;
+      for (int j=0; j < leaf->mObjects.size(); j++) {
+        Intersectable *object = leaf->mObjects[j];
+        if (!object->Mailed()) {
+          object->Mail();
+          // add this node to pvs of all nodes it can see
+          KdPvsMap::iterator ni = object->mKdPvs.mEntries.begin();
+          for (; ni != object->mKdPvs.mEntries.end(); ni++) {
+            KdNode *node = (*ni).first;
+            // $$ JB TEMPORARY solution -> should add object PVS or explictly computed
+            // kd tree PVS
+            if (leaf->mKdPvs.AddNodeSample(node))
+              totalPvsSize++;
+          }
+        }
+      }
+    } else {
+      KdInterior *interior = (KdInterior *)node;
+      nodeStack.push(interior->mFront);
+      nodeStack.push(interior->mBack);
+    }
+  }
+
+  return totalPvsSize;
+}