Changeset 353 for trunk/VUT/GtpVisibilityPreprocessor

Timestamp:

10/28/05 14:06:00 (19 years ago)

Author:

mattausch

Message:

 

File:

• trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.cpp (modified) (2 diffs)

trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.cpp

@@ -1678 +1678 @@
         return splits;
 }
-
-int BspTree::FindNeighbors(KdNode *n, vector<BspNode *> &neighbors, bool onlyUnmailed)
+/*
+void BspTree::ExtractSplitPlanes(BspNode *n, vector<Plane *> planes)
+{
+        while (!n->IsRoot())
+        {
+                if (!n->IsLeaf())
+                        planes.push_back(dynamic_cast<BspInterior *>(n)->GetPlane();
+
+                n = n->GetParent();
+        }
+}
+
+void BspTree::ExtractGeometry(BspNode *n, PolygonContainer &polys)
+{
+        vector<Plane *> planes;
+        ExtractSplitPlanes(n, planes);
+
+                while (!tStack.empty())
+        {
+                // filter polygons donw the tree
+                BspSplitData tData = tStack.top();
+            tStack.pop();       
+                
+                if (!tData.mNode->IsLeaf())
+                {
+                        BspInterior *interior = dynamic_cast<BspInterior *>(tData.mNode);
+                        if (tData.mNode != tree.GetRoot())
+                                tData.mSides.push_back(tData.mIsFront); // add current side
+
+                        // bounded plane is added to the polygons
+                        Polygon3 *planePoly = tree.GetBoundingBox().CrossSection(*interior->GetPlane());
+                
+                        // do all the splits with the previous planes
+                        for (int i = 0; i < (int)tData.mPlanes.size(); ++i)
+                        {
+                                VertexContainer splitPts;
+                                Polygon3 *frontPoly = new Polygon3();
+                                Polygon3 *backPoly = new Polygon3();
+
+                                if (planePoly->ClassifyPlane(*tData.mPlanes[i]) == Polygon3::SPLIT)
+                                {
+                                        planePoly->Split(*tData.mPlanes[i], *frontPoly, *backPoly, splitPts);
+                                        DEL_PTR(planePoly);
+
+                                        if(tData.mSides[i] == true)
+                                        {
+                                                planePoly = frontPoly;
+                                                DEL_PTR(backPoly);
+                                        }
+                                        else
+                                        {
+                                                planePoly = backPoly;
+                                                DEL_PTR(frontPoly);
+                                        }
+                                }
+                        }
+
+                        tData.mPlanes.push_back(interior->GetPlane()); // add plane to split planes
+
+                        if (planePoly->Valid())
+                                polys.push_back(planePoly);
+                        else
+                        {
+                                //Debug << "polygon not valid: " << *planePoly << " size: " << (int)planePoly->mVertices.size() << endl;
+                                DEL_PTR(planePoly);
+                        }
+                        // push the children on the stack
+                        tStack.push(BspSplitData(interior->GetFront(), tData.mPlanes, tData.mSides, true));
+                        tStack.push(BspSplitData(interior->GetBack(), tData.mPlanes, tData.mSides, false));
+                }
+        }       
+        ExportPolygons(polys);
+        CLEAR_CONTAINER(polys);
+}
+
+int BspTree::FindNeighbors(BspNode *n, vector<BspNode *> &neighbors, bool onlyUnmailed)
 {
         stack<BspNode *> nodeStack;
@@ -1715 +1789 @@
         }
         return neighbors.size();
-}
+}*/