Changeset 4968 in orxonox.OLD for orxonox/trunk/src/lib/graphics/spatial_separation/quadtree_node.cc

Timestamp:

Jul 29, 2005, 12:20:03 AM (19 years ago)

Author:

patrick

Message:

orxonox/trunk: some fixeds in the quadtree framework. No debug draw anymore

File:

• orxonox/trunk/src/lib/graphics/spatial_separation/quadtree_node.cc (modified) (9 diffs)

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

@@ -134 +134 @@
   if( this->nodeD != NULL)
     delete this->nodeD;
+
+  if( this->pTriangles)
+    delete [] this->pTriangles;
+
+  if( this->pDimension)
+    delete this->pDimension;
 }
 
@@ -374 +380 @@
  * @returns true if the vector is included
   */
-bool QuadtreeNode::includesPoint(const Vector& v)
+bool QuadtreeNode::includesPoint(const Vector& v) const
 {
   Vector center = *this->pDimension->getCenter();
@@ -381 +387 @@
   if( v.x > center.x - ax && v.x < center.x + ax &&
       v.z > center.z - ax && v.z < center.z + ax )
-  {
-    this->bDraw = true;
     return true;
-  }
   return false;
 }
@@ -396 +399 @@
 
   for( int i = 0; i < this->numTriangles; ++i)
+  {
+    a = *(sVec3D*)&this->pVertices[this->pTriangles[i]->indexToVertices[0]];
+    b = *(sVec3D*)&this->pVertices[this->pTriangles[i]->indexToVertices[1]];
+    c = *(sVec3D*)&this->pVertices[this->pTriangles[i]->indexToVertices[2]];
+
+    if( unlikely(this->pointInTriangle(position, a, b, c)))
     {
+      tri = this->pTriangles[i];
+      break;
+    }
+  }
+
+  /* calculate height out of the data collected above */
+
+}
+
+
+/**
+ *  get triangles that includes the position
+ * @param position the position that is going to be checked
+ * @returns the triangle in which the position is included, NULL if there is no such triangle
+
+ There is some random behaviour if there are more than one triangle at the same y
+ coordinate. At the moment the function just takes the first triangle, that included the
+ vector
+ */
+sTriangleExt* QuadtreeNode::getTriangle(const Vector& position) const
+{
+  Vector a, b, c;
+  PRINTF(0)("Get Triangle, %i\n", this->numTriangles);
+
+  for( int i = 0; i < numTriangles; ++i)
+    {
+
       a = *(sVec3D*)&this->pVertices[this->pTriangles[i]->indexToVertices[0]];
       b = *(sVec3D*)&this->pVertices[this->pTriangles[i]->indexToVertices[1]];
@@ -402 +438 @@
 
       if( unlikely(this->pointInTriangle(position, a, b, c)))
-        {
-          tri = this->pTriangles[i];
-          break;
-        }
-    }
-
-  /* calculate height out of the data collected above */
-
-}
-
-
-/**
- *  get triangles that includes the position
- * @param position the position that is going to be checked
- * @returns the triangle in which the position is included, NULL if there is no such triangle
-
- There is some random behaviour if there are more than one triangle at the same y
- coordinate. At the moment the function just takes the first triangle, that included the
- vector
-*/
-sTriangleExt* QuadtreeNode::getTriangle(const Vector& position) const
-{
-  Vector a, b, c;
-
-  for( int i = 0; i < this->numTriangles; ++i)
-    {
-      a = *(sVec3D*)&this->pVertices[this->pTriangles[i]->indexToVertices[0]];
-      b = *(sVec3D*)&this->pVertices[this->pTriangles[i]->indexToVertices[1]];
-      c = *(sVec3D*)&this->pVertices[this->pTriangles[i]->indexToVertices[2]];
-
-      if( unlikely(this->pointInTriangle(position, a, b, c)))
         return this->pTriangles[i];
+
     }
   return NULL;
@@ -446 +452 @@
  * @param rectangle edge c
  * @returns true if the point is inside
-*/
+ */
 bool QuadtreeNode::pointInTriangle(const Vector&p, const Vector& a, const Vector& b, const Vector& c) const
 {
+
+  PRINTF(0)("p: (%f, %f, %f)\n", p.x, p.y, p.z);
+  PRINTF(0)("a: (%f, %f, %f)\n", a.x, a.y, a.z);
+  PRINTF(0)("b: (%f, %f, %f)\n", b.x, b.y, b.z);
+  PRINTF(0)("c: (%f, %f, %f)\n", c.x, c.y, c.z);
+
   if( this->sameSide(p, a, b, c) && this->sameSide(p, b, a, c) && sameSide(p, c, a, b))
     return true;
@@ -461 +473 @@
  * @param begining point of the line
  * @param end of the line
-*/
+ */
 bool QuadtreeNode::sameSide(const Vector& p1, const Vector&p2, const Vector& a, const Vector& b) const
 {
@@ -509 +521 @@
 void QuadtreeNode::draw() const
 {
-  if( likely(!bDraw))
+  if( likely(!this->bDraw))
     return;
+
   Vector t1 = *this->pDimension->getCenter();
   float ax = this->pDimension->getAxis();
@@ -524 +537 @@
 
   glEnd();
-
-}
+}