Changeset 4920 in orxonox.OLD

Timestamp:

Jul 21, 2005, 2:33:32 PM (19 years ago)

Author:

patrick

Message:

orxonox/trunk: now the right quadtree is selected, position to quadtreeNode mapping works

Location:

orxonox/trunk/src/lib/graphics/spatial_separation

Files:

• quadtree.cc (modified) (4 diffs)
• quadtree.h (modified) (1 diff)
• quadtree_node.cc (modified) (1 diff)
• quadtree_node.h (modified) (1 diff)

orxonox/trunk/src/lib/graphics/spatial_separation/quadtree.cc

@@ -57 +57 @@
      this->rootNode->buildHashTable(this->nodes, index);
    }
+   this->sortHashTable(this->nodes);
    this->revertHashTable(this->nodes);
+
+   for(int i = 0; i < (int)pow(4, treeDepth); ++i)
+   {
+     printf("node %i, %f, %f \n", i, this->nodes[i]->getDimension()->getCenter()->x, this->nodes[i]->getDimension()->getCenter()->z);
+   }
 }
 
@@ -103 +109 @@
 
 
+void Quadtree::sortHashTable(QuadtreeNode** nodes)
+{
+  int                  len         = (int)pow(2, this->treeDepth);          //!< the length of a quadtree side
+  float a,b;
+  QuadtreeNode* tmpNode;
+
+  for(int i = 0; i < len; ++i)
+  {
+    for(int j = 0; j < len; ++j)
+    {
+      for(int k = j + 1; k < len; ++k)
+      {
+        a = this->nodes[i * len + j]->getDimension()->getCenter()->z;
+        b = this->nodes[i * len + k]->getDimension()->getCenter()->z;
+
+        if( b > a)
+        {
+          tmpNode = this->nodes[i * len + j];
+          this->nodes[i * len + j] = this->nodes[i * len + k];
+          this->nodes[i * len + k] = tmpNode;
+        }
+      }
+
+    }
+
+  }
+}
+
+
+
 QuadtreeNode* Quadtree::getQuadtreeFromPosition(const Vector& position)
 {
@@ -108 +144 @@
   Rectangle* r = this->rootNode->getDimension();
   float len = this->nodes[0]->getDimension()->getAxis() * 2.0f;
+
+  Vector edge;
   float xOff = r->getCenter()->x - r->getAxis();
   float yOff = r->getCenter()->z - r->getAxis();
+  edge.x = xOff, edge.z = yOff;
 
-  int i = (int)(( position.x - xOff) / len) + 1;
-  int j = (int)(( position.z - yOff) / len) + 1;
+  /* shift into model space */
+  v = position - edge;
+  /* map */
+  int i = (int)(v.x / len);
+  int j = (int)(v.z / len);
 
-  printf("the array coordinates are: %i, %i\n", i, j);
+  int max = (int)pow(2, this->treeDepth);
+
+  if( i < max && j < max)
+  {
+    printf("-----------\nthe array coordinates are: %i, %i\n", i, j);
+    printf("position: %f,%f, center %f, %f\n", position.x, position.z, this->nodes[i + j * max]->getDimension()->getCenter()->x, this->nodes[i + j * max]->getDimension()->getCenter()->z);
+    this->nodes[i + j * max]->drawTree(0,0);
+    this->nodes[i + j * max]->includesPoint(position);
+  }
+  else
+    printf("object has left terrain\n");
+
 }
 
@@ -126 +179 @@
   for(int i = 0; i < (int)pow(4, this->treeDepth); ++i)
   {
-    this->nodes[i]->drawTree(0, 0);
+    //this->nodes[i]->drawTree(0, 0);
   }
 

orxonox/trunk/src/lib/graphics/spatial_separation/quadtree.h

@@ -31 +31 @@
   private:
     void revertHashTable(QuadtreeNode** nodes);
+    void sortHashTable(QuadtreeNode** nodes);
 
  private:

orxonox/trunk/src/lib/graphics/spatial_separation/quadtree_node.cc

@@ -357 +357 @@
 
 
+bool QuadtreeNode::includesPoint(const Vector& v)
+{
+  Vector center = *this->pDimension->getCenter();
+  float ax = this->pDimension->getAxis();
+  if( v.x > center.x - ax && v.x < center.x + ax &&
+      v.z > center.z - ax && v.z < center.z + ax )
+    printf("THIS POINT IS INSIDE :) \n");
+  else
+    printf("POINT IS NOT INSIEDE\n");
+}
+
 /**
  *  draws the debug quadtree boxes around the model

orxonox/trunk/src/lib/graphics/spatial_separation/quadtree_node.h

@@ -31 +31 @@
     float getHeight(const Vector& position);
     Rectangle* getDimension() { return this->pDimension; }
+
+    bool includesPoint(const Vector& v);
 
     void drawTree(int depth, int drawMode) const;