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

Timestamp:

11/07/05 01:27:32 (19 years ago)

Author:

mattausch

Message:

fixed bug in pvs criterium, computing real area

File:

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

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h

@@ -459 +459 @@
                 @returns true if plane contributes to the cell.
         */
-        bool ConstructChildGeometry(PolygonContainer &newCell,
+        bool ConstructChildGeometry(PolygonContainer &childCell,
                                                             const PolygonContainer &cell,
                                                             const vector<Plane3 *> &planes,
@@ -535 +535 @@
         /** Evaluates the contribution of the candidate split plane.
                 
-                @param canditatePlane the candidate split plane
+                @param candidatePlane the candidate split plane
                 @param polys the polygons the split can be based on
                 @param rays the rays the split can be based on
+
                 @returns the cost of the candidate split plane
         */
-        float SplitPlaneCost(BspLeaf *leaf, 
-                                 const Plane3 &candidatePlane,
+        float SplitPlaneCost(const Plane3 &candidatePlane,
                                                  const PolygonContainer &polys,                                                  
-                                                 const BoundedRayContainer &rays) const;
+                                                 const BoundedRayContainer &rays,
+                                                 const PolygonContainer &cell,
+                                                 const vector<Plane3 *> &plane,
+                                                 const vector<bool> &sides,
+                                                 const int pvsSize) const;
 
         /** Strategies where the effect of the split plane is tested
@@ -549 +553 @@
                 @returns the cost of the candidate split plane
         */
-        float SplitPlaneCost(BspLeaf *leaf, 
-                                 const Plane3 &candidatePlane,
+        float SplitPlaneCost(const Plane3 &candidatePlane,
                                                  const PolygonContainer &polys) const;
 
         /** Strategies where the effect of the split plane is tested
             on all input polygons.
+
                 @returns the cost of the candidate split plane
         */
-        float SplitPlaneCost(BspLeaf *leaf,
-                                 const Plane3 &candidatePlane,
-                                                 const BoundedRayContainer &polys) const;
+        float SplitPlaneCost(const Plane3 &candidatePlane,
+                                                 const BoundedRayContainer &rays,
+                                                 const float frontArea,
+                                                 const float backArea,
+                                                 const int pvsSize) const;
 
         /** Filters next view cell down the tree and inserts it into the appropriate leaves
@@ -721 +727 @@
         /** Computes the pvs of the front and back leaf with a given classification.
         */
-        void ComputePvs(Intersectable &obj, 
+        void AddToPvs(Intersectable &obj, 
                                         float &frontPvs,
                                         float &backPvs,
@@ -729 +735 @@
                                         const int frontAndBackId) const;
         
+        int ComputePvsSize(const BoundedRayContainer &rays) const;
+
         /// Pointer to the root of the tree
         BspNode *mRoot;