Index: trunk/psLib/src/math/psPolynomial.c
===================================================================
--- trunk/psLib/src/math/psPolynomial.c	(revision 1903)
+++ trunk/psLib/src/math/psPolynomial.c	(revision 1907)
@@ -7,6 +7,6 @@
  *  polynomials.  It also contains a Gaussian functions.
  *
- *  @version $Revision: 1.41 $ $Name: not supported by cvs2svn $
- *  @date $Date: 2004-09-25 23:05:07 $
+ *  @version $Revision: 1.42 $ $Name: not supported by cvs2svn $
+ *  @date $Date: 2004-09-27 23:41:42 $
  *
  *  Copyright 2004 Maui High Performance Computing Center, University of Hawaii
@@ -111,5 +111,14 @@
 /*****************************************************************************/
 
-static psPolynomial1D* *CreateChebyshevPolys(int maxChebyPoly)
+/*****************************************************************************
+CreateChebyshevPolys(n): this routine takes as input the required order n,
+and returns as output as a pointer to an array of n psPolynomial1D
+structures, corresponding to the first n Chebyshev polynomials.
+ 
+XXX: The output should be static since the Chebyshev polynomials might be
+used frequently and the data structure created here does not contain the
+outer coefficients of the Chebyshev polynomials.
+ *****************************************************************************/
+static psPolynomial1D **CreateChebyshevPolys(int maxChebyPoly)
 {
     psPolynomial1D **chebPolys = NULL;
@@ -430,8 +439,4 @@
     Polynomial coefficients will be accessed in [w][x][y][z] fashion.
  
-    XXX: Determine, from IfA, whether or not the "mask[]" terms should be used
-    in polynomial evaluation.  If so, then all of the following polynomial
-    evaluation functions must be modified to do so.
- 
     XXX: Should the "coeffErr[]" should be used as well?
  *****************************************************************************/
@@ -502,4 +507,20 @@
     psFree(d);
     return(tmp);
+    /*
+        int n;
+        int i;
+        float tmp;
+        psPolynomial1D **chebPolys = NULL;
+     
+        n = myPoly->n;
+        chebPolys = CreateChebyshevPolys(n);
+     
+        tmp = 0.0;
+        for (i=0;i<myPoly->n;i++) {
+            tmp+= (myPoly->coeff[i] * psPolynomial1DEval(x, chebPolys[i]));
+        }
+        tmp-= (myPoly->coeff[0]/2.0);
+        return(tmp);
+    */
 }