Changeset 3265 for GTP/trunk/App/Demos/Vis/FriendlyCulling/src/BvhConstructor.cpp

Timestamp:

01/11/09 02:43:59 (15 years ago)

Author:

mattausch

Message:

worked on bvh constructor

File:

• GTP/trunk/App/Demos/Vis/FriendlyCulling/src/BvhConstructor.cpp (modified) (4 diffs)

GTP/trunk/App/Demos/Vis/FriendlyCulling/src/BvhConstructor.cpp

@@ -40 +40 @@
 
 int BvhConstructor::SortTriangles(BvhLeaf *leaf, 
-                                                                  int axis, 
-                                                                  float position)
+                                           int axis, 
+                                           float position
+                                           )
 {
         int i = leaf->mFirst;
@@ -48 +49 @@
     while (1)
         {
-                while (mEntities[i]->GetWorldCenter()[axis] < position) ++ i;
-                //while ((j > 0) && (position < mGeometry[j]->GetWorldCenter()[axis])) -- j;
-                while (position < mEntities[j]->GetWorldCenter()[axis]) -- j;
+                //while (mEntities[i]->GetWorldCenter()[axis] < position) ++ i;
+                //while (position < mEntities[j]->GetWorldCenter()[axis]) -- j;
+
+                while ((i < leaf->mLast) && (mEntities[i]->GetWorldCenter()[axis] < position)) ++ i;
+                while ((j > leaf->mFirst) && (position < mEntities[j]->GetWorldCenter()[axis])) -- j;
 
                 // sorting finished
@@ -81 +84 @@
         if (TerminationCriteriaMet(leaf))
         {
-                cout << "leaf constructed:" << leaf->mBox << " " << leaf->mFirst << " " << leaf->mLast << endl;
+                if (leaf->CountPrimitives() <= 0)
+                        cout << "leaf constructed:" << leaf->mBox << " " << leaf->mFirst << " " << leaf->mLast << endl;
                 return leaf;
         }
@@ -101 +105 @@
         {
                 // no split could be achieved => just halve number of objects
-                split = (leaf->mLast - leaf->mFirst) / 2;
+                split = (leaf->mLast + leaf->mFirst) / 2;
                 cerr << "no reduction " << leaf->CountPrimitives() << " " << leaf->mFirst << " " << leaf->mLast << endl;
         }