Changeset 4853 in orxonox.OLD for orxonox/trunk/src/lib/graphics

Timestamp:

Jul 13, 2005, 10:26:06 PM (19 years ago)

Author:

patrick

Message:

orxonox/trunk: progressing in quadtree separation process: list is done now the elements need to be filled into an array

File:

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

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

@@ -38 +38 @@
 {
   this->pModelInfo = pModelInfo;
-  this->pDimension = this->getDimension(this->pModelInfo);
   
   /* create an array of triangle references */
@@ -98 +97 @@
 {
   PRINTF(0)("got command to separate node\n");
+
+  this->pDimension = this->getDimension(this->pModelInfo);
+
   tList<sTriangleExt*>*           listA = new tList<sTriangleExt*>();    //!< triangle list of nodeA
   tList<sTriangleExt*>*           listB = new tList<sTriangleExt*>();    //!< triangle list of nodeB
@@ -111 +113 @@
         {
           pVert = &this->pVertices[this->pTriangles[i]->indexToVertices[j]];
-          if(  pVert[0] > rectCenter->x + this->offset && pVert[2] > rectCenter->z + this->offset)
-            printf("nA");
+          if( pVert[0] > rectCenter->x + this->offset && pVert[2] > rectCenter->z + this->offset)
+            listA->add(&this->pTriangles[i]);
           if( pVert[0] > rectCenter->x + this->offset && pVert[2]< rectCenter->z + this->offset) 
-            printf("nB");
+            listB->add(&this->pTriangles[i]);
           if( pVert[0] < rectCenter->x + this->offset && pVert[2] > rectCenter->z + this->offset)
-            printf("nC");
+            listC->add(&this->pTriangles[i]);
           if( pVert[0] < rectCenter->x + this->offset && pVert[2] < rectCenter->z + this->offset)
-            printf("nD");
+            listD->add(&this->pTriangles[i]);
         }
     }
-  PRINTF(0)("\nseparation complete\n");
-}
+  printf("Temp. list Num. o El: A: %i, B: %i, C: %i, D: %i\n", listA->getSize(), listB->getSize(), listC->getSize(), listD->getSize());
+
+
+  
+  /* Separating into to the triangle lists  */
+  sTriangleExt**                 pTriA;                                 //!< Triangle array A
+  sTriangleExt**                 pTriB;                                 //!< Triangle array B
+  sTriangleExt**                 pTriC;                                 //!< Triangle array C
+  sTriangleExt**                 pTriD;                                 //!< Triangle array D
+  float                          lenA;                                  //!< length array A
+  float                          lenB;                                  //!< length array B
+  float                          lenC;                                  //!< length array C
+  float                          lenD;                                  //!< length array D
+  tIterator<sTriangleExt*>*      iterator;                              //!< iterator for the list iterations
+  sTriangleExt*                  tempTri;                               //!< temp save place for triangle pointer
+
+  lenA = listA->getSize();
+  lenB = listB->getSize();
+  lenC = listC->getSize();
+  lenD = listD->getSize();
+  
+  pTriA = new sTriangleExt*[listA->getSize()];
+  pTriB = new sTriangleExt*[listB->getSize()];
+  pTriC = new sTriangleExt*[listC->getSize()];  
+  pTriD = new sTriangleExt*[listD->getSize()];
+
+
+  iterator = listA->getIterator();
+
+
+
+  PRINTF(0)("separation complete\n");
+}
+
 
 
@@ -170 +204 @@
 
   PRINTF(0)("Dimension Informationation: X: min/max %f/%f Y: min/max %f/%f\n", minX, maxX, minY, maxY);
+  PRINTF(0)("Center: %f,%f   Axis: %f\n", rect->getCenter()->x, rect->getCenter()->y, rect->getCenter()->z, rect->getAxis());
   return rect;
 }