Changeset 487 for trunk/VUT/GtpVisibilityPreprocessor/src/VspBspTree.cpp

Timestamp:

01/01/06 06:25:55 (19 years ago)

Author:

mattausch

Message:

fixed bug in raycasting
added valid view point regions, get view point only from valid regions

File:

• trunk/VUT/GtpVisibilityPreprocessor/src/VspBspTree.cpp (modified) (9 diffs)

trunk/VUT/GtpVisibilityPreprocessor/src/VspBspTree.cpp

@@ -85 +85 @@
         environment->GetBoolValue("VspBspTree.splitUseOnlyDrivingAxis", mOnlyDrivingAxis);
         environment->GetBoolValue("VspBspTree.PostProcess.useRaysForMerge", mUseRaysForMerge);
+        environment->GetIntValue("ViewCells.maxPvs", mMaxPvs);
+
 
         //-- debug output
@@ -400 +402 @@
                 BspLeaf *leaf = dynamic_cast<BspLeaf *>(newNode);
 
+                if (!CheckValid(tData))
+                {
+                        leaf->SetTreeValid(false);
+                        PropagateUpValidity(leaf);
+                }
+
                 // create new view cell for this leaf
                 BspViewCell *viewCell = new BspViewCell();
                 leaf->SetViewCell(viewCell);
-                
+        
+                //-- update pvs
+                int conSamp = 0, sampCon = 0;
+                AddToPvs(leaf, *tData.mRays, conSamp, sampCon);
+
+                mStat.contributingSamples += conSamp;
+                mStat.sampleContributions += sampCon;
+
+                //-- store additional info
                 if (mStoreRays)
                 {
@@ -415 +431 @@
                 leaf->mArea = tData.mArea;
 
-                //-- update pvs
-                int conSamp = 0, sampCon = 0;
-                AddToPvs(leaf, *tData.mRays, conSamp, sampCon);
-        
-                mStat.contributingSamples += conSamp;
-                mStat.sampleContributions += sampCon;
-
-                EvaluateLeafStats(tData);
-        }
-
+                EvaluateLeafStats(tData);               
+        }
 
         //-- cleanup
@@ -431 +439 @@
         return newNode;
 }
+
 
 BspNode *VspBspTree::SubdivideNode(VspBspTraversalData &tData,
@@ -519 +528 @@
 
         // replace a link from node's parent
-        if (!leaf->IsRoot())
+        if (parent)
         {
                 parent->ReplaceChildLink(leaf, interior);
@@ -1897 +1906 @@
                                 if (extSide < 0)
                                         node = in->GetBack();
-                                else if (extSide > 0)
+                                else 
                                         node = in->GetFront();
-
+                                                                
                                 continue; // no far child
                         }
@@ -1908 +1917 @@
                         // find intersection of ray segment with plane
                         extp = splitPlane.FindIntersection(origin, extp, &t);
-                        //cout << "x";
                 } 
                 else
                 {
-                        //cout << "o";
                         // reached leaf => intersection with view cell
                         BspLeaf *leaf = dynamic_cast<BspLeaf *>(node);
@@ -1937 +1944 @@
                 }
         }
-        //cout << "!!!!!!!!!!!" << endl;
+
         return hits;
 }
@@ -2506 +2513 @@
 }
 
+bool VspBspTree::ViewPointValid(const Vector3 &viewPoint) const
+{
+        BspNode *node = mRoot;
+
+        while (1)
+        {
+                // early exit
+                if (node->TreeValid())
+                        return true;
+
+                if (node->IsLeaf())
+                        return false;
+                        
+                BspInterior *in = dynamic_cast<BspInterior *>(node);
+                Plane3 splitPlane = in->GetPlane();
+                        
+                if (splitPlane.Side(viewPoint) <= 0) 
+                {
+                        node = in->GetBack();
+                } 
+                else
+                {
+                        node = in->GetFront();
+                }
+        }
+
+        // should never come here
+        return false;
+}
+
+
+bool VspBspTree::CheckValid(const VspBspTraversalData &data) const
+{
+        return data.mPvs <= mMaxPvs;
+}
+
+
+void VspBspTree::PropagateUpValidity(BspNode *node)
+{
+        while (!node->IsRoot() && node->TreeValid())
+        {
+                node = node->GetParent();
+                node->SetTreeValid(false);
+        }
+}
+
 
 /************************************************************************/