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

Timestamp:

09/16/05 19:24:10 (19 years ago)

Author:

mattausch

Message:

 

File:

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

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h

@@ -144 +144 @@
         */
         PolygonContainer *GetPolygons();
-int mViewCellIdx;
+        /** Stores polygons in node or discards them according to storePolys.
+        */
+        void ProcessPolygons(PolygonContainer *polys, const bool storePolys);
+
+//int mViewCellIdx;
 protected:
-
-        /** Adds or discards polygons according to storePolys.
-        */
-        void ProcessPolygons(PolygonContainer *polys, const bool storePolys);
-
 
         /// parent of this node
@@ -184 +183 @@
                 @param backPolys returns the polygons in the back of the split plane
                 @param splits number of splits
-                @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);
+                @returns split polygon if there is a polygon coincident to the split plane, NULL otherwise
+        */
+        Polygon3 *SplitPolygons(PolygonContainer *polys, 
+                                                        PolygonContainer *frontPolys, 
+                                                    PolygonContainer *backPolys, 
+                                                        int &splits, 
+                                                        bool storePolys = false);
+
+        /** Stores polygon in node or discards them according to storePolys.
+                @param polys the polygons
+                @param storePolys if the polygons should be stored or discarded
+        */
+        void ProcessPolygon(Polygon3 *poly, const bool storePolys);
 
         friend ostream &operator<<(ostream &s, const BspInterior &A)
@@ -194 +202 @@
         }
 
-protected:
+protected:      
         
-        /** Discards or stores polygon in node.
-                @param polys the polygons
-                @param storePolys if the polygons should be stored or discarded
-        */
-        void ProcessPolygon(Polygon3 *poly, const bool storePolys);
 
         /// Splitting plane corresponding to this node
@@ -255 +258 @@
                 /// current depth
                 int mDepth;
+                /// the polygon that drove the split plane computation
+                Polygon3 *mSplitPoly;
                 /// if the node is an inside or outside node with respect to the parent plane
-                bool mIsInside;
+                //bool mIsInside;
                 BspTraversalData() {}
                 
-                BspTraversalData(BspNode *node, PolygonContainer *polys, const int depth, const bool inside): 
-                mNode(node), mPolygons(polys), mDepth(depth), mIsInside(inside) {}
+                BspTraversalData(BspNode *node, PolygonContainer *polys, const int depth, Polygon3 *splitPoly): 
+                mNode(node), mPolygons(polys), mDepth(depth), mSplitPoly(splitPoly) {}
     };
 
@@ -345 +350 @@
             @param tStack current traversal stack
                 @param tData traversal data also holding node to be subdivided
-                @param viewCell the view cell that will be represented with this part of the Bsp tree.
+                @param viewCellContainer if not null, a new viewcell is created and stored in the container
                 @returns new root of the subtree
         */
-        BspNode *Subdivide(BspTraversalStack &tStack, BspTraversalData &tData, ViewCell *viewCell = NULL);
+        BspNode *Subdivide(BspTraversalStack &tStack, BspTraversalData &tData, ViewCellContainer *viewCells = NULL);
 
         /** Selects a splitting plane. 
@@ -358 +363 @@
                 (i.e., possibly more than one leaf).
         */
-        void InsertViewCell(ViewCell *viewCell);
+        //void InsertViewCell(ViewCell *viewCell);
         
         /** Subdivide leaf.
@@ -365 +370 @@
                 @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
-                @param if the polygons are outside or inside with respect to the interior node plane
+                @param splitPoly polygon that is coincident to the split plane, NULL if no such polygon
                 @returns the root of the subdivision
         */
@@ -371 +376 @@
                                                            PolygonContainer *polys, 
                                                            PolygonContainer *frontPolys, 
-                                                           PolygonContainer *backPolys, bool &inside);
+                                                           PolygonContainer *backPolys, Polygon3 **splitPoly);
 
         /** Filters polygons down the tree.
@@ -402 +407 @@
 
         /** Extract polygons of this mesh and add to polygon container.
+                @param mesh the mesh that drives the polygon construction
+                @param parent the parent intersectable this polygon is constructed from
                 @returns number of polygons
         */
-        int AddMesh2Polygons(Mesh *mesh, PolygonContainer &polys);
+        int AddMesh2Polygons(Mesh *mesh, PolygonContainer &polys, Intersectable *parent = NULL);
 
         /** A ray is cast possible intersecting the tree.