Changeset 3348 in orxonox.OLD for orxonox/branches/parenting/src/curve.cc

Timestamp:

Jan 6, 2005, 3:03:54 AM (19 years ago)

Author:

bensch

Message:

orxonox/branches/parenting: fixed major flaw in BezierCurve-calculation. before all BezierCurves started in the Origin. Now they are realy bezier-curves.

File:

• orxonox/branches/parenting/src/curve.cc (modified) (4 diffs)

orxonox/branches/parenting/src/curve.cc

@@ -24 +24 @@
 #include "curve.h"
 #include "matrix.h"
+#include "debug.h"
 
 #include <math.h>
@@ -113 +114 @@
 
   // rebuilding the Curve itself
-  int k=0;
-  int binCoef = 1;
-  while(tmpNode)
-    {
-      if (k+1 < nodeCount-k)
-        binCoef *=(nodeCount-k)/(k+1);
-      else
-        binCoef /= (k+1)/(nodeCount-k);
-      ++k;
+  float k=0;
+  float n = nodeCount -1;
+  float binCoef = 1;
+  printf("n=%f\n", n);
+  while(tmpNode)
+    {
       tmpNode->factor = binCoef;
-      tmpNode = tmpNode->next;
+      printf("bincoef: %f\n", binCoef);
+      if (tmpNode =tmpNode->next)
+        {
+          binCoef *=(n-k)/(k+1);
+          ++k;
+        }
     }
 
@@ -149 +152 @@
    \param t The position on the Curve (0<=t<=1)
    \return the Position on the Path
+   \todo implement nodeCount 0,1,2,3
 */
 Vector BezierCurve::calcPos(float t) 
 {
-  if (nodeCount <=4)
+  if (nodeCount < 4)
     {
       //    if (verbose >= 1)
@@ -160 +164 @@
   PathNode* tmpNode = firstNode;
   Vector ret = Vector(0.0,0.0,0.0);
-  float factor = 1.0*pow(1.0-t,nodeCount);
-  while(tmpNode)
-    {
-      factor *= t/(1.0-t); // same as pow but much faster.
+  double factor = pow(1.0-t,nodeCount-1);
+  while(tmpNode)
+    {
       ret.x += tmpNode->factor * factor * tmpNode->position.x;
       ret.y += tmpNode->factor * factor * tmpNode->position.y;
       ret.z += tmpNode->factor * factor * tmpNode->position.z;
+      factor *= t/(1.0-t); // same as pow but much faster.
 
       tmpNode = tmpNode->next;