Changeset 297 for trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h

Timestamp:

09/26/05 02:00:42 (19 years ago)

Author:

mattausch

Message:

added bsp split plane criteria

File:

• trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h (modified) (7 diffs)

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h

@@ -162 +162 @@
 class BspInterior : public BspNode 
 {
+        friend BspTree;
 public:
         /** Standard contructor taking split plane as argument.
@@ -275 +276 @@
 
         /** Default constructor creating an empty tree.
+                @param viewCell view cell corresponding to unbounded space
         */ 
-        BspTree();
+        BspTree(ViewCell *viewCell);
 
         ~BspTree();
@@ -427 +429 @@
         inline int GetNextCandidateIdx(const int max) const;
 
+        /** Helper function which extracts a view cell on the front and the back
+                of the split plane.
+                @param backViewCell returns view cell on the back of the split plane
+                @param frontViewCell returns a view cell on the front of the split plane
+                @param coincident container of polygons coincident to the split plane
+                @param splitPlane the split plane which decides about back and front
+                @param extractFront if a front view cell is extracted
+                @param extractBack if a back view cell is extracted
+        */
+        void ExtractViewCells(ViewCell **backViewCell, 
+                                                  ViewCell **frontViewCell,
+                                                  const PolygonContainer &coincident,
+                                                  const Plane3 splitPlane, 
+                                                  const bool extractFront, 
+                                                  const bool extractBack) const;
+        
         /// Pointer to the root of the tree
         BspNode *mRoot;
@@ -436 +454 @@
 
         /// Strategies for choosing next split plane.
-        enum {NEXT_POLYGON = 0, 
-                  LEAST_SPLITS = 2, 
-                  BALANCED_TREE = 4, 
-                  VERTICAL_AXIS = 8, 
-                  AXIS_ALIGNED = 16};
+        enum {NO_STRATEGY = 0,
+                  NEXT_POLYGON = 1, 
+                  AXIS_ALIGNED = 2,
+                  LEAST_SPLITS = 4, 
+                  BALANCED_POLYS = 8,
+                  BALANCED_VIEW_CELLS = 16,
+                  LARGEST_POLY_AREA = 32,
+                  VERTICAL_AXIS = 64
+                };
 
         /// box around the whole view domain
@@ -448 +470 @@
         bool mStorePolys;
 
-        /// vertical axis of scene
-        Vector3 mVerticalAxis;
+        /// view cell corresponding to unbounded space
+        ViewCell *mViewCell;
 
 public:
@@ -465 +487 @@
         /// BSP tree construction method
         static int sConstructionMethod;
-
+        /// maximal number of polygons where we do axis aligned splits
+        static int sTermMaxPolysForAxisAligned;
+
+        // factors to guid the split plane heuristics
         static float sLeastSplitsFactor;
-        static float sBalancedTreeFactor;
-        static float sVerticalFactor;
-
+        static float sBalancedPolysFactor;
+        static float sBalancedViewCellsFactor;
+        static float sVerticalSplitsFactor;
+        
 private:
         /** Evaluates split plane classification with respect to the plane's 
@@ -478 +504 @@
                 contribution for a minimum number splits in the tree.
         */
-        static float sBalancedTreeTable[4];
+        static float sBalancedPolysTable[4];
 };