Changeset 234 for trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.cpp

Timestamp:

08/10/05 18:07:51 (19 years ago)

Author:

mattausch

Message:

added bsp tree stuff

File:

• trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.cpp (modified) (8 diffs)

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.cpp

@@ -247 +247 @@
 
 BspTree::BspTree(const ViewCellContainer &viewCells): 
-mMaxPolys(0), mMaxDepth(0), mRoot(NULL)
+mMaxPolys(0), mMaxDepth(999999), mRoot(NULL) // null => until we stripped all polygons
 {
         //mRootCell = cell;
@@ -298 +298 @@
         CopyMesh2Polygon(viewCell->GetMesh(), polys);
 
-        tStack.push(BspTraversalData(mRoot, NULL, &polys, 0, viewCell));
+        tStack.push(BspTraversalData(mRoot, NULL, &polys, 0));
 
         while (!tStack.empty())
@@ -318 +318 @@
 
                         // push the children on the stack
-                        if (frontPolys->size() > 0)
+                        if (frontPolys->size() > 0) // if polygons on this side of bsp tree
                                 tStack.push(BspTraversalData(interior->GetFront(), interior->GetParent(), frontPolys, tData.mDepth + 1));
                         else
                                 delete frontPolys;
 
-                        if (backPolys > 0)
-                                tStack.push(BspTraversalData(interior->GetBack(), interior->GetParent(), backPolys, tData.mDepth + 1)); // TODO: really need to keep viewcell??
+                        if (backPolys > 0) // if polygons on this side of bsp tree
+                                tStack.push(BspTraversalData(interior->GetBack(), interior->GetParent(), backPolys, tData.mDepth + 1));
                         else
                                 delete backPolys;
@@ -330 +330 @@
                 else // reached leaf and must split
                 {
-                        BuildTree(tStack, tData);
-                }
-        }
-/*      BspNode *currentNode = mRoot;
-  
-        std::stack<BspTraversalData> tStack;
-        //  stack<STraversalData> tStack;
-
-        //tStack.push(tdata);
-
-        while (!tStack.empty()) 
-        {
-            BspTraversalData data = tStack.top();
-
-            tStack.pop();
-    
-                Mesh backPolys;
-                Mesh frontPolys;
-
-                if (data.mNode->IsLeaf()) // if we have a leaf => subdivide
-                {
-                        BspNode *node = SubdivideNode(dynamic_cast<BspLeaf *>(data.mNode),
-                                                                                  data.mParent,
-                                                                                  data.mPolys,
-                                                                              data.mDepth,
-                                                                                  data.viewCell,
-                                                                                  backPolys,
-                                                                                  frontPolys);
-        
-                        if (!node->IsLeaf()) // node was subdivided
-                        {
-                                BspInterior *interior = dynamic_cast<BspInterior *>(node);
-
-                                // push the children on the stack (there are always two children)
-                                //tStack.push(BspTraversalData(interior->GetBack(), interior, backPolys, data.mDepth + 1));
-                                //tStack.push(BspTraversalData(interior->GetFront(), interior, frontPolys, data.mDepth + 1));
-                        }
-                }
-        }*/
+                        BuildTree(tStack, tData, NULL);
+                }
+        }
 }
 
@@ -415 +379 @@
         Copy2PolygonSoup(objects, *polys);
 
-        BspTraversalData tData(mRoot, mRoot->GetParent(), polys, 0, NULL);
+        BspTraversalData tData(mRoot, mRoot->GetParent(), polys, 0);
         tStack.push(tData);
 
@@ -428 +392 @@
 }
 
-void BspTree::BuildTree(BspTraversalStack &tStack, BspTraversalData &currentData)
+void BspTree::BuildTree(BspTraversalStack &tStack, BspTraversalData &currentData, ViewCell *viewCell)
 {
         PolygonQueue *backPolys = new PolygonQueue();
@@ -437 +401 @@
                                                                   currentData.mPolys,
                                                                   currentData.mDepth,
-                                                                  currentData.mViewCell,
+                                                                  viewCell,
                                                                   backPolys,
                                                                   frontPolys);
@@ -446 +410 @@
 
                 // push the children on the stack (there are always two children)
-                tStack.push(BspTraversalData(interior->GetBack(), interior, backPolys, currentData.mDepth + 1, NULL));
-                tStack.push(BspTraversalData(interior->GetFront(), interior, frontPolys, currentData.mDepth + 1, currentData.mViewCell));
+                tStack.push(BspTraversalData(interior->GetBack(), interior, backPolys, currentData.mDepth + 1));
+                tStack.push(BspTraversalData(interior->GetFront(), interior, frontPolys, currentData.mDepth + 1));
         }
 }