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

Timestamp:

09/14/05 18:32:40 (19 years ago)

Author:

mattausch

Message:

did bsp stuff

File:

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

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.cpp

@@ -33 +33 @@
 const int FACTOR_LEAST_SPLITS = 1;
 
+int counter = 0;
+bool BspTree::displayDebug = false;
 /****************************************************************/
 /*                  class BspNode implementation                */
 /****************************************************************/
 
-BspNode::BspNode(): mParent(NULL), mPolygons(NULL)
+BspNode::BspNode(): mParent(NULL), mPolygons(NULL),mViewCellIdx(0)
 {}
 
-BspNode::BspNode(BspInterior *parent): mParent(parent), mPolygons(NULL)
+BspNode::BspNode(BspInterior *parent): mParent(parent), mPolygons(NULL),mViewCellIdx(0)
 {}
 
@@ -147 +149 @@
                                                                 int &splits, bool storePolys)
 {
-#ifdef _Debug
+//#ifdef _Debug
+        if (BspTree::displayDebug)
         Debug << "Splitting polygons of node " << this << " with plane " << mPlane << endl;
-#endif
+//#endif
         bool inside = false;
 
@@ -157 +160 @@
                 polys->pop_back();
 
+                if (BspTree::displayDebug) Debug << "New polygon with plane: " << poly->GetSupportingPlane() << "\n";
+
                 // test if split is neccessary
                 int classification = poly->ClassifyPlane(mPlane);
@@ -162 +167 @@
                 Polygon3 *front_piece = NULL;
                 Polygon3 *back_piece = NULL;
-                
+        
                 switch (classification)
                 {
@@ -170 +175 @@
                                         // same surface normal
                                         inside = (DotProd(mPlane.mNormal, poly->GetSupportingPlane().mNormal) > 0);
-                                        
-                                //Debug << "coincident" << endl;
+                                        if (BspTree::displayDebug)      
+                                Debug << "coincident" << endl;
                                 // discard polygons or saves them in node
                                 ProcessPolygon(poly, storePolys);
                                 break;
-                        case Polygon3::FRONT_SIDE:
-                                //Debug << "front" << endl;
+                        case Polygon3::FRONT_SIDE:      if (BspTree::displayDebug)
+                                Debug << "front" << endl;
                                 frontPolys->push_back(poly);
                                 break;
                         case Polygon3::BACK_SIDE:
-                                inside = true;
-                                //Debug << "back" << endl;
+                                inside = true;  if (BspTree::displayDebug)
+                                Debug << "back" << endl;
                                 backPolys->push_back(poly);
                                 break;
                         case Polygon3::SPLIT:
-                                inside = true;
-                                //Debug << "split " << poly << endl;
+                                inside = true;                          
 
                                 front_piece = new Polygon3();
@@ -197 +201 @@
                                 backPolys->push_back(back_piece);
 
-#ifdef _DEBUG
-                                Debug << "split " << *poly << endl << *front_piece << endl << *back_piece << endl;
-#endif
+//#ifdef _DEBUG
+                                if (BspTree::displayDebug)Debug << "split " << *poly << endl << *front_piece << endl << *back_piece << endl;
+//#endif
                                 // save or discard polygons
                                 ProcessPolygon(poly, storePolys);
@@ -258 +262 @@
 mRoot(NULL), 
 mIsIncremential(false),
-mStorePolys(false)
+mStorePolys(true)
 {
         Randomize(); // initialise random generator for heuristics
@@ -440 +444 @@
                 Polygon3 *poly = new Polygon3((*fi), mesh);
                 polys.push_back(poly);
+                if (displayDebug)
+                        Debug << *poly << endl;
                 polysNum ++;
         }
@@ -531 +537 @@
 
         long startTime = GetTime();
-
-        int counter = 0;
+displayDebug = true;
+        counter = 0;
         Debug << "**** Starting view cell insertion ****" << endl;
         for (it = viewCells.begin(); it != viewCells.end(); ++ it)
         {
-                Debug << "** inserting view cell " << counter ++ << " **" << endl;
-                InsertViewCell(*it);
+                if ((counter == 12) || (counter == 14))
+                {Debug << "** inserting view cell " << counter << " **" << endl;
+                InsertViewCell(*it);}
+                counter ++;
         }
 
@@ -609 +617 @@
         {
 //#ifdef _DEBUG
-                Debug << "subdivision terminated at depth " << tData.mDepth << ", #polys: " << (int)tData.mPolygons->size() << endl;
+                if (displayDebug)
+                        Debug << "subdivision terminated at depth " << tData.mDepth << ", #polys: " << (int)tData.mPolygons->size() << endl;
 //#endif
 
@@ -620 +629 @@
 
                         if (leaf->GetViewCell())
-                                Debug << "ERROR: leaf already has view cell" << endl;
-
+                                Debug << "ERROR: leaf already has view cell " << leaf->mViewCellIdx << endl;
+
+                        leaf->mViewCellIdx = counter;
                         Debug << "insert view cell" << endl;
                         leaf->SetViewCell(viewCell);