Changeset 5684 in orxonox.OLD for trunk/src/lib/collision_detection/obb_tree_node.cc

Timestamp:

Nov 21, 2005, 10:33:42 PM (19 years ago)

Author:

patrick

Message:

orxonox/trunk: extended the obb interface dramaticaly:D , in near future it will support the modelInfo structure and therefore will be based on triangles

File:

• trunk/src/lib/collision_detection/obb_tree_node.cc (modified) (5 diffs)

trunk/src/lib/collision_detection/obb_tree_node.cc

@@ -96 +96 @@
 
 
+/**
+ *  creates a new BVTree or BVTree partition
+ * @param depth: how much more depth-steps to go: if == 1 don't go any deeper!
+ * @param modInfo: model informations from the abstrac model
+ * 
+ * this function creates the Bounding Volume tree from a modelInfo struct and bases its calculations
+ * on the triangle informations (triangle soup not polygon soup)
+ */
+void OBBTreeNode::spawnBVTree(const int depth, const modelInfo& modInfo)
+{
+  int length = 0;
+  sVec3D* verticesList;
+  
+  PRINT(3)("\n");
+  this->treeIndex = this->obbTree->getID();
+  PRINTF(3)("OBB Depth: %i, tree index: %i, numVertices: %i\n", depth, treeIndex, length);
+  this->depth = depth;
+
+
+  this->bvElement = new OBB();
+  this->bvElement->vertices = verticesList;
+  this->bvElement->numOfVertices = length;
+  PRINTF(3)("Created OBBox\n");
+  this->calculateBoxCovariance(this->bvElement, modInfo);
+  PRINTF(3)("Calculated attributes1\n");
+  this->calculateBoxEigenvectors(this->bvElement, modInfo);
+  PRINTF(3)("Calculated attributes2\n");
+  this->calculateBoxAxis(this->bvElement,modInfo);
+  PRINTF(3)("Calculated attributes3\n");
+
+  /* if this is the first node, the vertices data are the original ones of the model itself, so dont delete them in cleanup */
+  if( this->treeIndex == 1)
+    this->bvElement->bOrigVertices = true;
+
+  if( likely( this->depth > 0))
+  {
+    this->forkBox(this->bvElement);
+
+
+//     if(this->tmpLen1 > 2)
+//     {
+//       OBBTreeNode* node1 = new OBBTreeNode();
+//       this->nodeLeft = node1;
+//       this->nodeLeft->spawnBVTree(depth - 1, this->tmpVert1, this->tmpLen1);
+//     }
+//     else
+//     {
+//       PRINTF(3)("Aboarding tree walk: less than 3 vertices left\n");
+//     }
+// 
+//     if( this->tmpLen2 > 2)
+//     {
+//       OBBTreeNode* node2 = new OBBTreeNode();
+//       this->nodeRight = node2;
+//       this->nodeRight->spawnBVTree(depth - 1, this->tmpVert2, this->tmpLen2);
+//     }
+//     else
+//     {
+//       PRINTF(3)("Abording tree walk: less than 3 vertices left\n");
+//     }
+
+  }
+}
+
 
 /**
@@ -101 +165 @@
  * @param depth: how much more depth-steps to go: if == 1 don't go any deeper!
  * @param verticesList: the list of vertices of the object - each vertices triple is interpreted as a triangle
+ * 
+ * this function creates an Bounding Volume tree from a vertices soup (no triangle data)
  */
 void OBBTreeNode::spawnBVTree(const int depth, sVec3D *verticesList, const int length)
@@ -151 +217 @@
       PRINTF(3)("Abording tree walk: less than 3 vertices left\n");
     }
-
-  }
-}
-
+  }
+}
+
+
+void OBBTreeNode::calculateBoxCovariance(OBB* box, const modelInfo& modInfo)
+{}
 
 
@@ -346 +414 @@
 
 
+void OBBTreeNode::calculateBoxEigenvectors(OBB* box, const modelInfo& modInfo)
+{}
 
 void OBBTreeNode::calculateBoxEigenvectors(OBB* box, sVec3D* verticesList, int length)
@@ -394 +464 @@
 //   PRINTF(0)("eigenvector: %f, %f, %f\n", box->axis[2].x, box->axis[2].y, box->axis[2].z);
 }
+
+
+void OBBTreeNode::calculateBoxAxis(OBB* box, const modelInfo& modInfo)
+{}