Changeset 1357 for GTP/trunk/Lib/Vis/Preprocessing/src/BvHierarchy.h

Timestamp:

09/13/06 17:15:26 (18 years ago)

Author:

mattausch

Message:

implemented the global version of the bounding volume construction

File:

• GTP/trunk/Lib/Vis/Preprocessing/src/BvHierarchy.h (modified) (13 diffs)

GTP/trunk/Lib/Vis/Preprocessing/src/BvHierarchy.h

@@ -35 +35 @@
 class VspTree;
 class ViewCellsContainer;
-//class BvhSubdivisionCandidate;
 
 
@@ -149 +148 @@
         /** The bounding box specifies the node extent.
         */
+        inline 
         AxisAlignedBox3 GetBoundingBox() const
         { return mBoundingBox; }
 
 
+        inline 
         void SetBoundingBox(const AxisAlignedBox3 &boundingBox) 
         { mBoundingBox = boundingBox; }
@@ -298 +299 @@
                 mMaxCostMisses(0), 
                 mAxis(0)
-                //mObjectsStart(0),
-                //mObjectsEnd(0)
-                {}
+                {
+                        mSortedObjects[0] = mSortedObjects[1] = mSortedObjects[2] = NULL;
+                }
                 
                 BvhTraversalData(BvhLeaf *node, 
@@ -312 +313 @@
                 mMaxCostMisses(0),
                 mAxis(0)
-                //mObjectsStart(0)
-                //mObjectsEnd(0)
-                {}
-
-                /// deletes contents and sets them to NULL
+                {
+                        mSortedObjects[0] = mSortedObjects[1] = mSortedObjects[2] = NULL;
+                }
+
+                /** Deletes contents and sets them to NULL.
+                */
                 void Clear()
                 {
                         DEL_PTR(mNode);
+                        /*DEL_PTR(mSortedObjects[0]);
+                        DEL_PTR(mSortedObjects[1]);
+                        DEL_PTR(mSortedObjects[2]);*/
                 }
 
@@ -334 +339 @@
                 /// current axis
                 int mAxis;
-                /// start of objects
-                SortableEntryContainer::const_iterator mObjectsStart;
-                /// end of objects
-                SortableEntryContainer::const_iterator mObjectsEnd;
+                /// the sorted objects for the three dimensions
+                ObjectContainer *mSortedObjects[3];             
     };
 
-        /** Candidate for a view space split.
+
+        /** Candidate for a object space split.
         */
         class BvhSubdivisionCandidate: public SubdivisionCandidate
@@ -618 +622 @@
 
         
-        /** Sorts split candidates for cost heuristics using axis aligned splits.
+        /** Prepare split candidates for cost heuristics using axis aligned splits.
                 @param node the current node
                 @param axis the current split axis
         */
-        static void SortSubdivisionCandidates(
-                const ObjectContainer &objects,
-                vector<SortableEntry> **subdivisionCandidates,
+        void PrepareLocalSubdivisionCandidates(
+                const BvhTraversalData &tData,
                 const int axis);
 
-        /** Computes best cost for axis aligned planes.
+        static void CreateLocalSubdivisionCandidates(
+                const ObjectContainer &objects, 
+                SortableEntryContainer **subdivisionCandidates,
+                const bool sort,
+                const int axis);
+
+        /** Computes object partition with the best cost according to the heurisics.
+                @param tData the traversal data
+                @param axis the split axis
+                @param objectsFront the objects in the front child bv
+                @param objectsBack the objects in the back child bv
+                @param backObjectsStart the iterator marking the position where the back objects begin
+
+                @returns relative cost (relative to parent cost)
         */
         float EvalLocalCostHeuristics(
@@ -633 +649 @@
                 const int axis,
                 ObjectContainer &objectsFront,
-                ObjectContainer &objectsFBack);
+                ObjectContainer &objectsBack);
 
         /** Evaluates the contribution to the front and back volume
@@ -708 +724 @@
         float EvalViewCellsVolume(const ObjectContainer &objects) const;
 
+        void CreateInitialSortedObjectList(BvhTraversalData &tData);
+
+        void AssignSortedObjects(
+                const BvhSubdivisionCandidate &sc,
+                BvhTraversalData &frontData,
+                BvhTraversalData &backData);
+
 
 protected:
@@ -735 +758 @@
 
 
-        //-- local termination
+        ////////////////////////////////
+        //-- local termination criteria
 
         /// maximal possible depth
@@ -751 +775 @@
 
 
-        //-- global criteria
+        ////////////////////////////////////
+        //-- global termination criteria
 
         float mTermMinGlobalCostRatio;
@@ -765 +790 @@
 
 
+        ////////////////////////////////////////
         //-- split heuristics based parameters
         
@@ -772 +798 @@
         /// if only driving axis should be used for split
         bool mOnlyDrivingAxis;
-        
         /// current time stamp (used for keeping split history)
         int mTimeStamp;
         // if rays should be stored in leaves
         bool mStoreRays;
-
-        /// epsilon for geometric comparisons
-        float mEpsilon;
-
-        /// subdivision stats output file
+        // subdivision stats output file
         ofstream  mSubdivisionStats;
         /// keeps track of cost during subdivision
@@ -789 +810 @@
         /// number of currenly generated view cells
         int mCreatedLeaves;
-
         /// represents min and max band for sweep
         float mSplitBorder;
-
         /// weight between render cost decrease and node render cost
         float mRenderCostDecreaseWeight;
-
         /// stores the kd node intersectables used for pvs
         BvhIntersectableMap mBvhIntersectables;
 
+        bool mUseGlobalSorting;
 };