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

Timestamp:

02/04/06 21:36:40 (18 years ago)

Author:

mattausch

Message:

implemented some code for merge history loading

File:

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

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.cpp

@@ -15 +15 @@
 #include <stack>
 
+
+
 //-- static members
 
@@ -173 +175 @@
 
 
-BspLeaf::BspLeaf(BspViewCell *viewCell): 
+BspLeaf::BspLeaf(ViewCell *viewCell): 
 mViewCell(viewCell)
 {
@@ -185 +187 @@
 
 
-BspLeaf::BspLeaf(BspInterior *parent, BspViewCell *viewCell): 
+BspLeaf::BspLeaf(BspInterior *parent, ViewCell *viewCell): 
 BspNode(parent), mViewCell(viewCell), mPvs(NULL)
 {
 }
 
-BspViewCell *BspLeaf::GetViewCell() const
+ViewCell *BspLeaf::GetViewCell() const
 {
         return mViewCell;
 }
 
-void BspLeaf::SetViewCell(BspViewCell *viewCell)
+void BspLeaf::SetViewCell(ViewCell *viewCell)
 {
         mViewCell = viewCell;
@@ -218 +220 @@
         Randomize(); // initialise random generator for heuristics
 
-        // the view cell corresponding to unbounded space
-        mRootCell = new BspViewCell();
+        mOutOfBoundsCell = GetOrCreateOutOfBoundsCell();
 
         //-- termination criteria for autopartition
@@ -443 +444 @@
         DEL_PTR(mRoot);
 
-        // HACK: view cells not generated => root cell not used
-        if (mGenerateViewCells)
-                DEL_PTR(mRootCell);
-}
-
-BspViewCell *BspTree::GetRootCell() const
-{
-        return mRootCell;
-}
+        // TODO must be deleted if used!!
+        //if (mGenerateViewCells) DEL_PTR(mOutOfBoundsCell);
+}
+
+BspViewCell *BspTree::GetOutOfBoundsCell()
+{
+        return mOutOfBoundsCell;
+}
+
+
+BspNode *BspTree::GetRoot() const
+{
+        return mRoot;
+}
+
+BspViewCell *BspTree::GetOrCreateOutOfBoundsCell()
+{
+        if (!mOutOfBoundsCell)
+        {
+                mOutOfBoundsCell = new BspViewCell();
+                mOutOfBoundsCell->SetId(-1);
+                mOutOfBoundsCell->SetValid(false);
+        }
+
+        return mOutOfBoundsCell;
+}
+
 
 void BspTree::InsertViewCell(ViewCell *viewCell)
@@ -466 +485 @@
 }
 
+
 void BspTree::InsertPolygons(PolygonContainer *polys)
 {       
@@ -477 +497 @@
                                                                  polys, 
                                                                  0, 
-                                                                 mRootCell, 
+                                                                 mOutOfBoundsCell, 
                                                                  new BoundedRayContainer(), 
                                                                  0, 
@@ -510 +530 @@
                                 
                                 // extract view cells associated with the split polygons
-                                ViewCell *frontViewCell = mRootCell;
-                                ViewCell *backViewCell = mRootCell;
+                                ViewCell *frontViewCell = GetOrCreateOutOfBoundsCell();
+                                ViewCell *backViewCell = GetOrCreateOutOfBoundsCell();
                         
                                 BspTraversalData frontData(interior->GetFront(), 
                                                                                    frontPolys, 
                                                                                    tData.mDepth + 1,
-                                                                                   mRootCell,   
+                                                                                   mOutOfBoundsCell,    
                                                                                    tData.mRays,
                                                                                    tData.mPvs,
@@ -525 +545 @@
                                                                                   backPolys,
                                                                                   tData.mDepth + 1,
-                                                                                  mRootCell,    
+                                                                                  mOutOfBoundsCell,     
                                                                                   tData.mRays,
                                                                                   tData.mPvs,
@@ -640 +660 @@
                         }
                 
-                        AddMeshToPolygons(mesh, polys, mRootCell);
+                        AddMeshToPolygons(mesh, polys, mOutOfBoundsCell);
                 }
         }
@@ -814 +834 @@
                                                    polys, 
                                                    0, 
-                                                   mRootCell, 
+                                                   GetOrCreateOutOfBoundsCell(), 
                                                    rays, 
                                                    ComputePvsSize(*rays), 
@@ -881 +901 @@
                 
                 //-- add pvs
-                if (viewCell != mRootCell)
+                if (viewCell != mOutOfBoundsCell)
                 {
                         int conSamp = 0, sampCon = 0;
@@ -909 +929 @@
         PolygonContainer coincident;
         
-        BspTraversalData tFrontData(NULL, new PolygonContainer(), tData.mDepth + 1, mRootCell, 
+        BspTraversalData tFrontData(NULL, new PolygonContainer(), tData.mDepth + 1, mOutOfBoundsCell, 
                                                                 new BoundedRayContainer(), 0, 0, new BspNodeGeometry());
-        BspTraversalData tBackData(NULL, new PolygonContainer(), tData.mDepth + 1, mRootCell, 
+        BspTraversalData tBackData(NULL, new PolygonContainer(), tData.mDepth + 1, mOutOfBoundsCell, 
                                                            new BoundedRayContainer(), 0, 0, new BspNodeGeometry());
 
@@ -1812 +1832 @@
 }
 
-
-BspNode *BspTree::GetRoot() const
-{
-        return mRoot;
-}
 
 void BspTree::EvaluateLeafStats(const BspTraversalData &data)
@@ -2055 +2070 @@
 }
 
-bool BspTree::Export(const string filename)
-{
-        Exporter *exporter = Exporter::GetExporter(filename);
-
-        if (exporter) 
-        {
-                exporter->ExportBspTree(*this);
-                return true;
-        }       
-
-        return false;
-}
 
 void BspTree::CollectViewCells(ViewCellContainer &viewCells) const
@@ -2689 +2692 @@
                 if (ray->mViewCells.size() < 2)
                         continue;
-//TODO viewcellhierarchy
+
                 iit = ray->mViewCells.begin();
                 BspViewCell *bspVc = dynamic_cast<BspViewCell *>(*(iit ++));
@@ -3023 +3026 @@
 }
 
+
 void BspNodeGeometry::IncludeInBox(AxisAlignedBox3 &box)
 {
         Polygon3::IncludeInBox(mPolys, box);
 }
+
+
+bool BspTree::Export(ofstream &stream)
+{
+        ExportNode(mRoot, stream);
+
+        return true;
+}
+
+
+void BspTree::ExportNode(BspNode *node, ofstream &stream)
+{
+        if (node->IsLeaf())
+        {
+                BspLeaf *leaf = dynamic_cast<BspLeaf *>(node);
+                        
+                int id = -1;
+                if (leaf->GetViewCell() != mOutOfBoundsCell)
+                        id = leaf->GetViewCell()->GetId();
+
+                stream << "<Leaf viewCellId=\"" << id << "\" />" << endl;
+        }
+        else
+        {
+                BspInterior *interior = dynamic_cast<BspInterior *>(node);
+        
+                Plane3 plane = interior->GetPlane();
+                stream << "<Interior plane=\"" << plane.mNormal.x << " " 
+                           << plane.mNormal.y << " " << plane.mNormal.z << " " 
+                           << plane.mD << "\">" << endl;
+
+                ExportNode(interior->GetBack(), stream);
+                ExportNode(interior->GetFront(), stream);
+
+                stream << "</Interior>" << endl;
+        }
+}