Changeset 2762 for GTP/trunk/App/Demos/Vis/CHC_revisited/Bvh.cpp

Timestamp:

06/15/08 23:35:07 (16 years ago)

Author:

mattausch

Message:

debug version

File:

• GTP/trunk/App/Demos/Vis/CHC_revisited/Bvh.cpp (modified) (5 diffs)

GTP/trunk/App/Demos/Vis/CHC_revisited/Bvh.cpp

@@ -292 +292 @@
 
 
+bool Bvh::TestPlane(BvhNode *node, int i, bool &bIntersect)
+{
+        // do the test only if necessary
+        if (1)//node->mPlaneMask & (1 << i))
+        {//cout<<"plane "<< i << endl;
+                bool outs = true;
+                //-- test the n-vertex
+                for (int j = 0; j < 8; ++ j)
+                {
+                        if (sFrustum.mClipPlanes[i].Distance(node->mBox.GetVertex(j)) <= 0) outs = false;
+                }
+                if (outs) return 0;
+                //if ((node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 0], sFrustum.mClipPlanes[i]) > 0.0f))
+                        //&&    (node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 1], sFrustum.mClipPlanes[i]) > 0.0f))
+                {
+                        // outside
+                //      node->mPreferredPlane = i;
+                        //cout<<"f " << node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 0], sFrustum.mClipPlanes[i]) << " " << sFrustum.mClipPlanes[i] << endl;
+                //      return false;
+                }//else cout<<"ok " << node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 0], sFrustum.mClipPlanes[i]) << " " << sFrustum.mClipPlanes[i] << endl;
+
+                //-- test the p-vertex
+                if (node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 1], sFrustum.mClipPlanes[i]) <= 0.0f)
+                {
+                        // completely inside: children don't need to check against this plane no more
+                        node->mPlaneMask^= 1 << i;
+                }
+                else 
+                {
+                        bIntersect = true;
+                }
+        }
+
+        return true;
+}
+
+
 int     Bvh::IsWithinViewFrustum(BvhNode *node)
 {
@@ -300 +337 @@
 
 
+        for (int i = 0; i < 6; ++ i)
+        {
+                if (!TestPlane(node, i, bIntersect)) return 0;
+        }
+
         ////////
-        //-- do the view frustum culling for the planes [mPreferredPlane - 5]
-
+        //-- apply frustum culling for the planes [mPreferredPlane - 5]
+/*
         for (int i = node->mPreferredPlane; i < 6; ++ i)
         {
-                //-- do the test only if necessary
-                if (node->mPlaneMask & (1 << i))
-                {
-                        //-- test the n-vertex
-                        if (node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 0], sFrustum.mClipPlanes[i]) > 0.0f)
-                        {
-                                //-- outside
-                                node->mPreferredPlane = i;
-                                return 0;
-                        }
-
-                        //-- test the p-vertex
-                        if (node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 1], sFrustum.mClipPlanes[i]) <= 0.0f)
-                        {
-                                //-- completely inside: children don't need to check against this plane no more
-                                node->mPlaneMask^=      1 << i;
-                        }
-                        else 
-                        {
-                                bIntersect = true;
-                        }
-                }
+                if (!TestPlane(node, i, bIntersect)) return 0;
         }
 
@@ -334 +355 @@
         for (int i = 0; i < node->mPreferredPlane; ++ i)
         {
-                // do the test only if necessary
-                if (node->mPlaneMask & (1 << i))
-                {
-                        //-- test the n-vertex
-                        if (node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 0], sFrustum.mClipPlanes[i]) > 0.0f)
-                        {
-                                // outside
-                                node->mPreferredPlane = i;
-                                return 0;
-                        }
-
-                        //-- test the p-vertex
-                        if (node->mBox.GetDistance(sClipPlaneAABBVertexIndices[i * 2 + 1], sFrustum.mClipPlanes[i]) <= 0.0f)
-                        {
-                                // completely inside: children don't need to check against this plane no more
-                                node->mPlaneMask^= 1 << i;
-                        }
-                        else 
-                        {
-                                bIntersect = true;
-                        }
-                }
-        }
-
+                if (!TestPlane(node, i, bIntersect)) return 0;
+        }
+*/
         return bIntersect ? -1 : 1;
 }
@@ -373 +373 @@
         sFrustum.CalcNPVertexIndices(sClipPlaneAABBVertexIndices);
 
-        // calc near plane
-        sNearPlane = Plane3(mCamera->GetDirection(), 
-                                -mCamera->GetDirection() * mCamera->GetPosition());
+        for (int i = 0; i<12; ++ i)
+//cout<<" x " << sClipPlaneAABBVertexIndices[i];
+//      cout<<"\n********\n";
+        // near plane
+        sNearPlane = Plane3(mCamera->GetDirection(), mCamera->GetPosition());
+
+//      Debug << "near: " << sNearPlane << " d " << mCamera->GetDirection() << " " << mCamera->GetPosition() << std::endl;
+//      for (int i = 0; i < 6; ++ i) Debug << "plane: " << sFrustum.mClipPlanes[i] << std::endl;
 }
 
@@ -865 +870 @@
 
 
+void Bvh::Dummy()
+{
+        for (int i = 0; i < mGeometrySize; ++ i)
+                Debug << mGeometry[i]->id << " " << mGeometry[i]->GetGeometry()->GetBoundingBox() << endl;
+
+        AxisAlignedBox3 boxl; boxl.Initialize();
+        AxisAlignedBox3 boxr; boxr.Initialize();
+
+
+        for (int i = 0; i <= 107; ++ i)
+                boxl.Include(mGeometry[i]->GetBoundingBox());
+
+        for (int i = 108; i <= 193; ++ i)
+                boxr.Include(mGeometry[i]->GetBoundingBox());
+
+        Debug << "dummy " << boxl << " " << boxr << endl;
+
+        queue<BvhNode *> tStack;
+        tStack.push(mRoot);
+
+        while (!tStack.empty())
+        {
+                BvhNode *node = tStack.front();//top();
+                tStack.pop();
+
+                AxisAlignedBox3 box;
+                box.Initialize();
+
+                int i = 0;
+                for (int i = node->mFirst; i <= node->mLast; ++ i)
+                {
+                        if ((mGeometry[i]->id < node->mFirst) || (mGeometry[i]->id > node->mLast))
+                                cout << "big error!! " << mGeometry[i]->id << endl;
+                        else cout << "ok"<<mGeometry[i]->id;
+                        box.Include(mGeometry[i]->GetBoundingBox());
+                }
+
+                Debug<< box << " " << node->GetBox() << " f " << node->mFirst << " l " << node->mLast << " id " << node->GetId() << " l " << node->IsLeaf() << endl;
+
+                //node->mBox = box;
+                if (!node->IsLeaf())
+                {
+                        BvhInterior *interior = static_cast<BvhInterior *>(node);
+
+                        tStack.push(interior->mFront);
+                        tStack.push(interior->mBack);
+                }
+        }
+}
+
+
 void Bvh::SetVirtualLeaves(int numTriangles) 
 {