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

Timestamp:

10/13/05 13:10:21 (19 years ago)

Author:

mattausch

Message:

 

File:

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

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h

@@ -234 +234 @@
                 /// the view cell associated with this subdivsion
                 ViewCell *mViewCell;
-                
+                /// rays piercing this node
+                RayContainer *mRays;
+
                 BspTraversalData():
                 mNode(NULL),
                 mPolygons(NULL),
                 mDepth(0),
-                mViewCell(NULL)
+                mViewCell(NULL),
+                mRays(NULL)
                 {}
                 
@@ -245 +248 @@
                                                  PolygonContainer *polys, 
                                                  const int depth, 
-                                                 ViewCell *viewCell): 
+                                                 ViewCell *viewCell,
+                                                 RayContainer *rays = NULL): 
                 mNode(node), 
                 mPolygons(polys), 
                 mDepth(depth), 
-                mViewCell(viewCell)
+                mViewCell(viewCell),
+                mRays(rays)
                 {}
     };
@@ -353 +358 @@
         */
         float SplitPlaneCost(PolygonContainer &polys, 
-                                                 const Plane3 &candidatePlane);
+                                                 const Plane3 &candidatePlane,
+                                                 const RayContainer &rays);
 
         /** Evaluates tree stats in the BSP tree leafs.
@@ -369 +375 @@
                 @param leaf the leaf to be split
                 @param polys the polygon list on which the split decition is based
-                @Returns the split plane
+                @param rays ray container on which selection may be based
+                Returns the split plane
         */
         Plane3 SelectPlane(BspLeaf *leaf, 
-                                           PolygonContainer &polys);
+                                           PolygonContainer &polys,
+                                           const RayContainer &ray);
 
         /** Filters next view cell down the tree and inserts it into the appropriate leaves
@@ -390 +398 @@
                 @param backPolys returns the polygons in the back of the split plane
                 @param coincident returns the polygons coincident to the split plane
+                @param rays ray container used to guide the split process
                 @returns the root of the subdivision
         */
@@ -396 +405 @@
                                                            PolygonContainer &frontPolys,
                                                            PolygonContainer &backPolys, 
-                                                           PolygonContainer &coincident);
+                                                           PolygonContainer &coincident,
+                                                           const RayContainer &rays);
 
         /** Filters polygons down the tree.
@@ -413 +423 @@
                 2.5d aligned)
                 @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
         */
         Plane3 SelectPlaneHeuristics(PolygonContainer &polys, 
-                                                                const int maxTests);
+                                                                 const RayContainer &rays,
+                                                                 const int maxTests);
 
         /** Extracts the meshes of the objects and adds them to polygons. 
@@ -490 +502 @@
                                                          vector<SortableEntry> &splitCandidates) const;
 
+        /** Splits the rays into front and back rays according to split plane
+                @param rays contains the rays to be split. The rays are 
+                           distributed to front and back rays.
+                @param frontRays returns rays on the front side of the plane
+                @param backRays returns rays on the back side of the plane
+        */
+        void BspTree::SplitRays(const Plane3 plane,
+                                                        RayContainer &rays, 
+                                                        RayContainer &frontRays, 
+                                                        RayContainer &backRays);
+
         /// Pointer to the root of the tree
         BspNode *mRoot;