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

Timestamp:

Jul 13, 2005, 9:07:13 PM (20 years ago)

Author:

patrick

Message:

orxonox/trunk: start of the separation algorithm

File:

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

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

@@ -17 +17 @@
 
 #include "quadtree_node.h"
+#include "list.h"
+#include "vector.h"
 
 using namespace std;
@@ -36 +38 @@
 {
   this->pModelInfo = pModelInfo;
-  this->getDimension(this->pModelInfo);
+  this->pDimension = this->getDimension(this->pModelInfo);
+  
+  /* create an array of triangle references */
+  this->pTriangles = new sTriangleExt*[this->pModelInfo->numTriangles];
+  this->numTriangles = this->pModelInfo->numTriangles;
+  this->pVertices = this->pModelInfo->pVertices;
+  for( int i = 0; i < this->pModelInfo->numTriangles; ++i)
+    this->pTriangles[i] = &this->pModelInfo->pTriangles[i];
+  
 }
 
-
+ 
 /**
  *  standard deconstructor
@@ -63 +73 @@
 void QuadtreeNode::separateNode(float minLength)
 {}
+
+
+/**
+ *  gives the signal to separate the model into a quadtree
+ * @param treeDepth the max depth, the steps to go if treeDept == 0 leaf reached
+*/
+void QuadtreeNode::separateNode()
+{
+  tList<sTriangleExt*>*           listA = new tList<sTriangleExt*>();    //!< triangle list of nodeA
+  tList<sTriangleExt*>*           listB = new tList<sTriangleExt*>();    //!< triangle list of nodeB
+  tList<sTriangleExt*>*           listC = new tList<sTriangleExt*>();    //!< triangle list of nodeC
+  tList<sTriangleExt*>*           listD = new tList<sTriangleExt*>();    //!< triangle list of nodeD
+  const float*                    pVert;                                 //!< pointer to the vertices
+  const Vector*                   rectCenter;                            //!< vector to the center of the rect
+
+  rectCenter = this->pDimension->getCenter();
+  for( int i = 0; i < this->numTriangles; ++i)
+    {
+      for( int j = 0; j < 3; ++j)
+        {
+          pVert = &this->pVertices[this->pTriangles[i]->indexToVertices[j]];
+          if(  pVert[0] > rectCenter->x + this->offset && pVert[2] > rectCenter->z + this->offset)
+            printf("");
+
+        }
+    }
+}