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

Timestamp:

09/12/05 18:24:44 (19 years ago)

Author:

mattausch

Message:

debugged bsp stuff

File:

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

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h

@@ -107 +107 @@
 public:
         BspNode();
+        virtual ~BspNode();
         BspNode(BspInterior *parent);
 
@@ -126 +127 @@
         void SetParent(BspInterior *parent);
 
+        /** Returns pointer to polygons.
+        */
         PolygonContainer *GetPolygons();
 
-        /** Adds polygons to node.
-        */
-        void AddPolygons(PolygonContainer *polys);
-
 protected:
+
+        /** Adds or discards polygons according to storePolys.
+        */
+        void ProcessPolygons(PolygonContainer *polys, const bool storePolys);
+
 
         /// parent of this node
         BspInterior *mParent;
 
-        PolygonContainer mPolygons;
+        /// store polygons created during BSP splits
+        PolygonContainer *mPolygons;
 };
 
@@ -165 +170 @@
                 @param backPolys returns the polygons in the back of the split plane
                 @param splits number of splits
-        */
-        void SplitPolygons(PolygonContainer *polys, PolygonContainer *frontPolys, 
+                @returns true if one or more polygons are inside of the split plane
+        */
+        bool SplitPolygons(PolygonContainer *polys, PolygonContainer *frontPolys, 
                                            PolygonContainer *backPolys, int &splits, bool storePolys = false);
 
@@ -181 +187 @@
                 @param storePolys if the polygons should be stored or discarded
         */
-        void ProcessPolygon(Polygon3 *poly, bool storePolys);
+        void ProcessPolygon(Polygon3 *poly, const bool storePolys);
 
         /// Splitting plane corresponding to this node
@@ -201 +207 @@
         BspLeaf(ViewCell *viewCell);
         BspLeaf(BspInterior *parent);
+        BspLeaf(BspInterior *parent, ViewCell *viewCell);
 
         /** @return true since it is an interior node 
@@ -231 +238 @@
                 /// the current node
                 BspNode *mNode;
-                /// parent of current node
-                BspInterior *mParent;
                 /// polygonal data for splitting
                 PolygonContainer *mPolygons;
                 /// current depth
                 int mDepth;
-                
+                /// if the node is an inside or outside node with respect to the parent plane
+                bool mIsInside;
                 BspTraversalData() {}
                 
-                BspTraversalData(BspNode *node, BspInterior *parent, PolygonContainer *polys, const int depth): 
-                mNode(node), mParent(parent), mPolygons(polys), mDepth(depth) {}
+                BspTraversalData(BspNode *node, PolygonContainer *polys, const int depth, const bool inside): 
+                mNode(node), mPolygons(polys), mDepth(depth), mIsInside(inside) {}
     };
 
@@ -341 +347 @@
         /** Subdivide leaf.
                 @param leaf the leaf to be subdivided
-                @param parent the parent node of this leaf
                 @param polys the input polygons
-                @param depth the current tree depth
                 @param frontPolys the polygons of the front child node as a result from splitting
                 @param backPolys the polygons of the back child node as a result from splitting
-        */
-        BspNode *SubdivideNode(BspLeaf *leaf, 
-                                                   BspInterior *parent, 
-                                                   PolygonContainer *polys, 
-                                                   const int depth, 
-                                                   PolygonContainer *frontPolys, 
-                                                   PolygonContainer *backPolys);
+                @param if the polygons are outside or inside with respect to the interior node plane
+                @returns the root of the subdivision
+        */
+        BspInterior *SubdivideNode(BspLeaf *leaf, 
+                                                           PolygonContainer *polys, 
+                                                           PolygonContainer *frontPolys, 
+                                                           PolygonContainer *backPolys, bool &inside);
 
         /** Filters polygons down the tree.