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

Timestamp:

11/06/05 01:24:55 (19 years ago)

Author:

mattausch

Message:

 

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 ComputeChildrenGeometry(PolygonContainer &newCell,
-                                                        const PolygonContainer &cell,
-                                                        const vector<Plane3> &planes,
-                                                        const vector<bool> &sides,
-                                                        const Plane3 &splitPlane,
-                                                        const bool side) const;
+        bool ConstructChildGeometry(PolygonContainer &newCell,
+                                                            const PolygonContainer &cell,
+                                                            const vector<Plane3 *> &planes,
+                                                            const vector<bool> &sides,
+                                                            const Plane3 &splitPlane,
+                                                            const bool side) const;
 
 
@@ -540 +540 @@
                 @returns the cost of the candidate split plane
         */
-        float SplitPlaneCost(const Plane3 &candidatePlane,
+        float SplitPlaneCost(BspLeaf *leaf, 
+                                 const Plane3 &candidatePlane,
                                                  const PolygonContainer &polys,                                                  
                                                  const BoundedRayContainer &rays) const;
@@ -548 +549 @@
                 @returns the cost of the candidate split plane
         */
-        float SplitPlaneCost(const Plane3 &candidatePlane,
+        float SplitPlaneCost(BspLeaf *leaf, 
+                                 const Plane3 &candidatePlane,
                                                  const PolygonContainer &polys) const;
 
@@ -555 +557 @@
                 @returns the cost of the candidate split plane
         */
-        float SplitPlaneCost(const Plane3 &candidatePlane,
+        float SplitPlaneCost(BspLeaf *leaf,
+                                 const Plane3 &candidatePlane,
                                                  const BoundedRayContainer &polys) const;
 
@@ -608 +611 @@
                 @param maxRayCandidates the maximal number of ray candidates
         */
-        Plane3 SelectPlaneHeuristics(PolygonContainer &polys, 
+        Plane3 SelectPlaneHeuristics(BspLeaf *leaf,
+                                         PolygonContainer &polys, 
                                                                  const BoundedRayContainer &rays,
                                                                  const int maxPolyCandidates,