Changeset 610 for trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellsManager.h

Timestamp:

02/09/06 12:14:11 (19 years ago)

Author:

mattausch

Message:

 

File:

• trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellsManager.h (modified) (6 diffs)

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellsManager.h

@@ -6 +6 @@
 #include "Containers.h"
 #include "ViewCell.h"
+#include "ViewCellBsp.h"
 
 class ViewCell;
@@ -349 +350 @@
                                                                                 vector<MergeCandidate> &candidates) = 0;
 
-        
-  
-  void CollectViewCells(const int n) {
-        mNumActiveViewCells = n;
-        mViewCells.clear();
-        CollectViewCells();
-  }
-
-
-  virtual bool EqualToSpatialNode(ViewCell *viewCell) const { return false;}
+        void CollectViewCells(const int n);
+
+
+        virtual void CreateMergeHierarchy() {};
+        
+        virtual bool EqualToSpatialNode(ViewCell *viewCell) const { return false;}
+
+
 protected:
 
@@ -411 +410 @@
         void CreateViewCellMeshes();
 
-        /**
-                Exports single view cell.
-                NOTE: should be in exporter!!
-        */
-        void ExportViewCell(ViewCell *viewCell, ofstream &stream);
-
-
-        /** 
-                Takes different measures to prepares the view cells after loading them from disc.
+
+        /** Takes different measures to prepares the view cells after loading them from disc.
         */
         virtual void PrepareLoadedViewCells() {};
@@ -537 +529 @@
         bool ExportViewCells(const string filename);
 
+        void CreateMergeHierarchy();
+
+
 protected:
+
+        struct TraversalData
+        {  
+                ViewCellInterior *mParentViewCell;
+                BspNode *mNode;
+                
+
+                TraversalData() {}
+                TraversalData(BspNode *node, ViewCellInterior *vc):
+                         mNode(node), mParentViewCell(vc)
+                {}
+   
+                bool operator<(const TraversalData &b) const 
+                {
+                        return mNode->mTimeStamp < b.mNode->mTimeStamp;
+                }
+        };
+
+        typedef priority_queue<TraversalData> TraversalQueue;
 
         /** HACK
@@ -754 +768 @@
 protected:
 
+        struct TraversalData
+        {  
+                ViewCellInterior *mParentViewCell;
+                BspNode *mNode;
+                
+
+                TraversalData() {}
+                TraversalData(BspNode *node, ViewCellInterior *vc):
+                         mNode(node), mParentViewCell(vc)
+                {}
+   
+                bool operator<(const TraversalData &b) const 
+                {
+                        return mNode->mTimeStamp < b.mNode->mTimeStamp;
+                }
+        };
+
+        typedef priority_queue<TraversalData> TraversalQueue;
+
+        /** Returns node of the spatial hierarchy corresponding to the view cell
+                if such a node exists.
+        */
         BspNode *GetSpatialNode(ViewCell *viewCell) const;
+
         /** HACK
         */
@@ -778 +815 @@
         void PrepareLoadedViewCells();
 
-        
+        void CreateMergeHierarchy();
         /// the view space partition BSP tree.
         VspBspTree *mVspBspTree;