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

Timestamp:

08/12/05 18:42:20 (19 years ago)

Author:

mattausch

Message:

added bsp stuff

File:

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

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.cpp

@@ -96 +96 @@
                 polys->pop();
 
+                Debug << (*poly);
+
                 int result = poly->Side(&mPlane);
 
@@ -104 +106 @@
                 {
                         case Polygon3::COINCIDENT:
-                                break;
+                                //break; //TODO: comment in
                         case Polygon3::FRONT_SIDE:
                                 frontPolys->push(poly);
@@ -118 +120 @@
                                 poly->Split(&mPlane, front_piece, back_piece, splits);
                         
+                                Debug << "SPLIT, plane: " << mPlane << "\norginal: " << (*poly) << "\nback: " << (*back_piece) << "\nfront: " << (*front_piece) << endl;
                                 backPolys->push(back_piece);
                                 frontPolys->push(front_piece);
@@ -123 +126 @@
                                 // don't need polygon anymore
                                 DEL_PTR(poly);
+
                                 break;
                         default:
@@ -128 +132 @@
                 }
         }
-        // delete old polygons
-//      Polygon3::DeletePolygons(polys);
 }
 
@@ -204 +206 @@
 
         app << "#N_PMAXDEPTHLEAVES ( Percentage of leaves at maxdepth )\n"<<
-        maxDepthNodes*100/(double)Leaves()<<endl;
-
-        app << "#N_PMAXDEPTH ( Maximal reached depth )\n"<<
-        maxDepth*100/(double)Leaves()<<endl;
+        maxDepthNodes * 100 / (double)Leaves() << endl;
+
+        app << "#N_PMAXDEPTH ( Maximal reached depth )\n" << maxDepth <<endl;
 
         app << "#N_ADDED_RAYREFS  (Number of dynamically added ray references )\n"<<
@@ -334 +335 @@
         ObjectContainer::const_iterator it, it_end = objects.end();
 
-        for (it = objects.begin(); it != it_end; ++ it)
-        {
-                Intersectable *object = *it;
+        int limit = min((int)objects.size(), 1);
+
+        //for (it = objects.begin(); it != it_end; ++ it)
+        for (int i = 0; i < limit; ++i)
+        {
+                Intersectable *object = objects[i];//*it;
                 Mesh *mesh = NULL;
 
@@ -343 +347 @@
                 {
                 case Intersectable::MESH_INSTANCE:
-                        
                         mesh = dynamic_cast<MeshInstance *>(object)->GetMesh();
-                        
+                        break;
                 case Intersectable::VIEWCELL:
                         mesh = dynamic_cast<ViewCell *>(object)->GetMesh();
-                        // copy the mesh data to polygons
-                        CopyMesh2Polygons(mesh, polys);
                         break;
                 default:
                         break;
                 }
-        }
+                
+                if (mesh) // copy the mesh data to polygons
+                {
+                        CopyMesh2Polygons(mesh, polys);
+                }
+        }
+
         Debug << "number of polygons: " << polys.size() << endl;
 }
@@ -360 +367 @@
 void BspTree::Construct(const ObjectContainer &objects)
 {
+        Debug << "Constructing tree using object container\n";
+
         mTermMaxPolygons = sTermMaxPolygons;
         mTermMaxDepth = sTermMaxDepth;
@@ -376 +385 @@
         while (!tStack.empty()) 
         {
-            tData = tStack.top();
+                tData = tStack.top();
             tStack.pop();
-    
+                
                 Subdivide(tStack, tData);
         }
@@ -385 +394 @@
 void BspTree::Subdivide(BspTraversalStack &tStack, BspTraversalData &tData, ViewCell *viewCell)
 {
+        //Debug << "Subdividing node\n";
+
         PolygonQueue *backPolys = new PolygonQueue();
         PolygonQueue *frontPolys = new PolygonQueue();
@@ -404 +415 @@
                 tStack.push(BspTraversalData(interior->GetFront(), interior, frontPolys, tData.mDepth + 1));
         }
-        else
+        else // tree terminates here
+        {
                 EvaluateLeafStats(tData);
+                // don't need to store polygon information => delete polygons
+                Polygon3::DeletePolygons(tData.mPolygons);
+        }
 }
 
@@ -434 +449 @@
         if ((polys->size() <= mTermMaxPolygons) || (depth >= mTermMaxDepth))
         {
-                // don't need to store polygon information => delete polygons
-                Polygon3::DeletePolygons(polys);
                 // Debug << polys->size() << ", " << depth << endl;             
                 return leaf;
@@ -444 +457 @@
         // add the new nodes to the tree + select subdivision plane
         BspInterior *node = new BspInterior(SelectPlane(polys)); 
-
+        Debug << "new bspinterior: " << (*node) << endl;
         // split polygon according to current plane
         int splits = 0;
@@ -463 +476 @@
         node->SetupChildLinks(back, front);
 
-        DEL_PTR(leaf);
+        DEL_PTR(leaf); // leaf not member of tree anymore
 
         return node;
@@ -473 +486 @@
         environment->GetIntValue("BspTree.Termination.maxPolygons", sTermMaxPolygons);
 
+        //-- extract strategy to choose the next split plane
         char splitPlaneStrategyStr[60];
 
         environment->GetStringValue("BspTree.splitPlaneStrategy", splitPlaneStrategyStr);
-        // TODO: Extract nodes
+        
+        sSplitPlaneStrategy = BspTree::NEXT_POLYGON;
+        
+        if (strcmp(splitPlaneStrategyStr, "nextPolygon") == 0)
+                sSplitPlaneStrategy = BspTree::NEXT_POLYGON;
+        else if (strcmp(splitPlaneStrategyStr, "leastSplits") == 0)
+                sSplitPlaneStrategy = BspTree::LEAST_SPLITS;
+        else 
+        {
+                cerr << "Wrong BSP split plane strategy " << splitPlaneStrategyStr << endl;
+                exit(1);
+    }
 }
 
 void BspTree::EvaluateLeafStats(const BspTraversalData &data)
 {
-
   // the node became a leaf -> evaluate stats for leafs
   BspLeaf *leaf = dynamic_cast<BspLeaf *>(data.mNode);
 
-  if (data.mDepth > mTermMaxDepth)
-    ++ mStat.maxDepthNodes; 
+  if (data.mDepth >= mTermMaxDepth)
+  {
+          ++ mStat.maxDepthNodes; 
+  }
 
   // record maximal depth
   if (data.mDepth > mStat.maxDepth)
           mStat.maxDepth = data.mDepth;
+
+  Debug << "BSP Traversal data. Depth: " << data.mDepth << " (max: " << mTermMaxDepth<< "), #polygons: " << 
+          data.mPolygons->size() << " (max: " << mTermMaxPolygons << ")" << endl;
 }
 //} // GtpVisibilityPreprocessor