Bernstein(i,n,u,B)
        {
        for (j=0;j<=n; j++)
                temp[j]=0.0;
                temp[n-j]= 1.0;
                u1= 1.0-u;
                for (k=1; k<=n; k++)
                  for (j=n; j>=k; j--)
                        temp[j]=u1*temp[j]+u*temp[j-1];
                B= temp[n];
                }
 AllBernstein(n,u,B)
 {/* Compute all nth-degree Bernstein polynomials. */
  /* Input: n, u */
  /* Output: B (an array, B[0],....,B[n])*/
  B[0]=1.0;
  u1 = 1.0-u;
  for (j=1; j<=n; j++)
        {
        saved = 0.0;
        for (k=0; k<j; k++)
                {
                temp = B[k];
                B[k] = saved+u1*temp;
                saved= u*temp;
                }
            B[j] = saved;
            }
  }
  PointOnBezierCurve(P,n,u,C)
  {/* Compute point on Bezier curve. */
   /* Input: P,n,u */
   /* Output: C(a point) */
   AllBernstein(n,u,B) /*B is a local array*/
   C= 0.0;
   for (k=0; k<=n; k++)  C= C + B[k]*P[k];
   }