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

Timestamp:

11/05/05 12:40:40 (19 years ago)

Author:

mattausch

Message:

worked on pvs heuristics

File:

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

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h

@@ -455 +455 @@
         BspLeaf *GetRandomLeaf(const bool onlyUnmailed = false);
 
-        /** Adds halfspace to cell definition.
-                @param side indicates which side of halfspace is added
-        */
-        void AddHalfspace(PolygonContainer &cell, 
-                                          vector<Plane3> &planes,
-                                          vector<bool> &sides,
-                                          const Plane3 &halfspace, 
-                                          const bool side) const;
+        /** Computes new cell based on the old cell definition and a new split plane
+                @param side indicates which side of the halfspace 
+                @returns true if plane contributes to the cell.
+        */
+        bool ComputeChildrenGeometry(PolygonContainer &newCell,
+                                                        const PolygonContainer &cell,
+                                                        const vector<Plane3> &planes,
+                                                        const vector<bool> &sides,
+                                                        const Plane3 &splitPlane,
+                                                        const bool side) const;
+
 
         /** Returns true if merge criteria are reached.
@@ -602 +605 @@
                 @param polygons container of polygons
                 @param rays bundle of rays on which the split can be based
-                @param maxTests the maximal number of candidate tests
+                @param maxPolyCandidates the maximal number of tested polygon candidates
+                @param maxRayCandidates the maximal number of ray candidates
         */
         Plane3 SelectPlaneHeuristics(PolygonContainer &polys, 
                                                                  const BoundedRayContainer &rays,
-                                                                 const int maxTests);
+                                                                 const int maxPolyCandidates,
+                                                                 const int maxRayCandidates);
 
         /** Extracts the meshes of the objects and adds them to polygons. 
@@ -710 +715 @@
         void ExtractSplitPlanes(BspNode *n, vector<Plane3 *> &planes, vector<bool> &sides) const;
 
-        int CountPvs(const BoundedRayContainer &rays) const;
-        
-        float PvsValue(Intersectable &obj, 
-                                   const int cf, 
-                                   const int frontId, 
-                                   const int backId, 
-                                   const int frontAndBackId) const;
+        /** Computes the pvs of the front and back leaf with a given classification.
+        */
+        void ComputePvs(Intersectable &obj, 
+                                        float &frontPvs,
+                                        float &backPvs,
+                                        const int cf, 
+                                        const int frontId, 
+                                        const int backId, 
+                                        const int frontAndBackId) const;
         
         /// Pointer to the root of the tree
         BspNode *mRoot;
-
                 
         BspTreeStatistics mStat;
@@ -764 +770 @@
         static int sSplitPlaneStrategy;
         /// number of candidates evaluated for the next split plane
-        static int sMaxCandidates;
+        static int sMaxPolyCandidates;
+        static int sMaxRayCandidates;
         /// BSP tree construction method
         static int sConstructionMethod;