Changeset 3217 in orxonox.OLD

Timestamp:

Dec 18, 2004, 3:48:43 PM (19 years ago)

Author:

bensch

Message:

orxonox/trunk: copied Curve-class from branches/bezierCurve. The only really useable Class from there.

Location:

orxonox/trunk/src

Files:

• curve.cc (copied) (copied from orxonox/branches/bezierTrack/src/curve.cc) (4 diffs)
• curve.h (copied) (copied from orxonox/branches/bezierTrack/src/curve.h) (1 diff)

orxonox/trunk/src/curve.cc

@@ -59 +59 @@
 /**
    \brief Deletes a BezierCurve.
+
    It does this by freeing all the space taken over from the nodes
 */
@@ -110 +111 @@
 }
 
+/**
+   \brief Calulates the direction of the Curve at time t.
+   \param The time at which to evaluate the curve.
+   \returns The vvaluated Vector.
+*/
 Vector BezierCurve::calcDir (float t)
 {
@@ -133 +139 @@
 }
 
+/**
+   \brief Calculates the Quaternion needed for our rotations
+   \param t The time at which to evaluate the cuve.
+   \returns The evaluated Quaternion.
+*/
 Quaternion BezierCurve::calcQuat (float t)
 {
@@ -148 +159 @@
 }
 
-
+/**
+   \brief ncr-calculator, did not find an other method
+   \todo a c++ variante to do this
+*/
 int ncr(int n, int i)
 {

orxonox/trunk/src/curve.h

@@ -12 +12 @@
 
 
-
+//! An abstract class to handle curves.
 class Curve
 {
  protected:
-  int nodeCount;
-  Vector curvePoint;
-  float localTime; //!< if the time of one point is asked more than once the programm will not calculate it again.
+  int nodeCount;         //!< The count of nodes the Curve has.
+  Vector curvePoint;     //!< The point on the Cureve at a local Time.
+  float localTime;       //!< If the time of one point is asked more than once the programm will not calculate it again.
 
+  //! Handles the curve-points (dynamic List)
   struct PathNode
   {
-    int number;
-    Vector position;
-    PathNode* next;
+    int number;          //!< The N-th node of this curve.
+    Vector position;     //!< Vector Pointung to this curve-point.
+    PathNode* next;      //!< Pointer to the next Node.
   };
 
-  PathNode* firstNode; 
-  PathNode* currentNode; 
+  PathNode* firstNode;   //!< First node of the curve.
+  PathNode* currentNode; //!< The node we are working with (the Last node).
 
  public:
-
   void addNode (const Vector& newNode);