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

Timestamp:

12/05/05 04:42:54 (19 years ago)

Author:

mattausch

Message:

fixed bug in VspBspTree?
view cells in VssPreprocessor?
bounding rays for vspkdtree

File:

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

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h

@@ -7 +7 @@
 #include <stack>
 #include "Statistics.h"
+#include "VssRay.h"
+
 
 class ViewCell;
@@ -27 +29 @@
         float GetArea() const;
         
-        /** Computes new cell based on the old cell definition and a new split plane
-                @param side indicates which side of the halfspace 
-        */
-        void SplitGeometry(BspNodeGeometry &front, 
+        /** Computes new front and back geometry based on the old cell 
+                geometry and a new split plane
+        */
+        void SplitGeometry(BspNodeGeometry &front,
                                            BspNodeGeometry &back,
-                                           const BspTree &tree,
-                                           const Plane3 &splitPlane) const;
-
-        Polygon3 *SplitPolygon(Polygon3 *poly, const BspTree &tree) const;
+                                           const Plane3 &splitPlane,
+                       const AxisAlignedBox3 &box,
+                                           const float epsilon) const;
+
+        Polygon3 *SplitPolygon(Polygon3 *poly, const float epsilon) const;
 
         PolygonContainer mPolys;
@@ -270 +273 @@
         BspNode *GetFront();
 
-        Plane3 *GetPlane();
-
+        /** Returns split plane.
+        */
+        Plane3 GetPlane() const;
+
+        /** Replace front or back child with new child.
+        */
         void ReplaceChildLink(BspNode *oldChild, BspNode *newChild);
+        /** Replace front and back child.
+        */
         void SetupChildLinks(BspNode *b, BspNode *f);
-
-        /** Splits polygons with respect to the split plane.
-                @param polys the polygons to be split. the polygons are consumed and
-                           distributed to the containers frontPolys, backPolys, coincident.
-                @param frontPolys returns the polygons in the front of the split plane
-                @param backPolys returns the polygons in the back of the split plane
-                @param coincident returns the polygons coincident to the split plane
-
-                @returns the number of splits   
-        */
-        int SplitPolygons(PolygonContainer &polys, 
-                                          PolygonContainer &frontPolys, 
-                                          PolygonContainer &backPolys, 
-                                          PolygonContainer &coincident);
 
         friend ostream &operator<<(ostream &s, const BspInterior &A)
@@ -298 +293 @@
         /// Splitting plane corresponding to this node
         Plane3 mPlane;
+
         /// back node
         BspNode *mBack;
@@ -328 +324 @@
         void SetViewCell(BspViewCell *viewCell);
 
-        /** Adds ray sample contributions to the PVS.
-                @param sampleContributions the number contributions of the samples
-                @param contributingSampels the number of contributing rays
-                
-        */
-        void AddToPvs(const BoundedRayContainer &rays, 
-                                  int &sampleContributions,
-                                  int &contributingSamples);
+        VssRayContainer mVssRays;
 
 protected:
@@ -516 +505 @@
         BspViewCell *GetRootCell() const;
 
-        /** Parses the environment and stores the global BSP tree parameters
-        */
-        static void ParseEnvironment();
-
+        /** Returns epsilon of this tree.
+        */
+        float GetEpsilon() const;
 
 protected:
@@ -722 +710 @@
         bool SelectAxisAlignedPlane(Plane3 &plane, const PolygonContainer &polys) const;
 
-        /** Bounds ray and returns minT and maxT.
-                @returns true if ray hits BSP tree bounding box
-        */
-        bool BoundRay(const Ray &ray, float &minT, float &maxT) const;
-
         /** Subdivides the rays into front and back rays according to the split plane.
                 
@@ -768 +751 @@
         */
         float AccumulatedRayLength(BoundedRayContainer &rays) const;
+
+        /** Splits polygons with respect to the split plane.
+                @param polys the polygons to be split. the polygons are consumed and
+                           distributed to the containers frontPolys, backPolys, coincident.
+                @param frontPolys returns the polygons in the front of the split plane
+                @param backPolys returns the polygons in the back of the split plane
+                @param coincident returns the polygons coincident to the split plane
+
+                @returns the number of splits   
+        */
+        int SplitPolygons(const Plane3 &plane,
+                                          PolygonContainer &polys, 
+                                          PolygonContainer &frontPolys, 
+                                          PolygonContainer &backPolys, 
+                                          PolygonContainer &coincident) const;
+
+        /** Adds ray sample contributions to the PVS.
+                @param sampleContributions the number contributions of the samples
+                @param contributingSampels the number of contributing rays
+                
+        */
+        void AddToPvs(BspLeaf *leaf,
+                                  const BoundedRayContainer &rays, 
+                                  int &sampleContributions,
+                                  int &contributingSamples);
 
         /// Pointer to the root of the tree.
@@ -852 +860 @@
         bool mPvsUseArea;
 
+        /// epsilon where two points are still considered equal
+        float mEpsilon;
+
 private: