Changeset 170 for trunk/VUT/GtpVisibilityPreprocessor/src/KdTree.cpp

Timestamp:

07/12/05 21:08:40 (19 years ago)

Author:

bittner

Message:

mesh kd tree added

File:

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

trunk/VUT/GtpVisibilityPreprocessor/src/KdTree.cpp

@@ -25 +25 @@
   environment->GetFloatValue("KdTree.Termination.ct_div_ci", mCt_div_ci);
   environment->GetFloatValue("KdTree.splitBorder", mSplitBorder);
+
+  environment->GetBoolValue("KdTree.sahUseFaces", mSahUseFaces);
 
   char splitType[64];
@@ -42 +44 @@
         exit(1);
       }
-
-  splitCandidates = new vector<SortableEntry>;
+  splitCandidates = NULL;
 }
 
@@ -49 +50 @@
 KdTree::Construct()
 {
+  if (!splitCandidates)
+    splitCandidates = new vector<SortableEntry>;
+
   // first construct a leaf that will get subdivide
   KdLeaf *leaf = (KdLeaf *) mRoot;
@@ -63 +67 @@
   }
 
-  cout <<"box:"<< mBox<<endl;
-
-  
+  cout <<"KdTree Root Box:"<< mBox<<endl;
   mRoot = Subdivide(TraversalData(leaf, mBox, 0));
+
+  // remove the allocated array
+  delete splitCandidates;
 
   return true;
@@ -131 +136 @@
   //  cerr<<"\n OBJECTS="<<leaf->mObjects.size()<<endl;
   return
-    (leaf->mObjects.size() < mTermMinCost) ||
+    (leaf->mObjects.size() <= mTermMinCost) ||
     (leaf->mDepth >= mTermMaxDepth);
   
@@ -424 +429 @@
   // C = ct_div_ci  + (ol + or)/queries
 
+  int totalFaces = 0;
+  vector<SortableEntry>::const_iterator ci;
+
+  for(ci = splitCandidates->begin();
+      ci < splitCandidates->end();
+      ci++) 
+    if ((*ci).type == SortableEntry::MESH_MIN) {
+      Mesh *mesh = ((MeshInstance *)(*ci).data)->GetMesh();
+      totalFaces += mesh->mFaces.size();
+    }
+
+  int facesLeft = 0;
+  int facesRight = totalFaces;
+
   int objectsLeft = 0, objectsRight = node->mObjects.size();
-
+  
   float minBox = box.Min(axis);
   float maxBox = box.Max(axis);
   float boxArea = box.SurfaceArea();
   
-  
-  
   float minBand = minBox + mSplitBorder*(maxBox - minBox);
   float maxBand = minBox + (1.0f - mSplitBorder)*(maxBox - minBox);
@@ -437 +454 @@
   float minSum = 1e20;
   
-  for(vector<SortableEntry>::const_iterator ci = splitCandidates->begin();
+  for(ci = splitCandidates->begin();
       ci < splitCandidates->end();
       ci++) {
-    
+    Mesh *mesh = ((MeshInstance *)(*ci).data)->GetMesh();
     switch ((*ci).type) {
     case SortableEntry::MESH_MIN:
       objectsLeft++;
+      facesLeft += mesh->mFaces.size();
       break;
     case SortableEntry::MESH_MAX:
       objectsRight--;
+      facesRight -= mesh->mFaces.size();
       break;
     }
@@ -456 +475 @@
       rbox.SetMin(axis, (*ci).value);
 
-      float sum = objectsLeft*lbox.SurfaceArea() + objectsRight*rbox.SurfaceArea();
+      float sum;
+      if (mSahUseFaces)
+        sum = facesLeft*lbox.SurfaceArea() + facesRight*rbox.SurfaceArea();
+      else
+        sum = objectsLeft*lbox.SurfaceArea() + objectsRight*rbox.SurfaceArea();
       
       //      cout<<"pos="<<(*ci).value<<"\t q=("<<ql<<","<<qr<<")\t r=("<<rl<<","<<rr<<")"<<endl;
@@ -471 +494 @@
   }
   
-  float oldCost = node->mObjects.size();
+  float oldCost = mSahUseFaces ? totalFaces : node->mObjects.size();
   float newCost = mCt_div_ci + minSum/boxArea;
   float ratio = newCost/oldCost;
-
+  
 #if 0
   cout<<"===================="<<endl;