src/gen/gensurf.c

#ifndef lint
static const char RCSid[] = "$Id: gensurf.c,v 2.31 2025/01/21 01:56:27 greg Exp $";
#endif
/*
 *  gensurf.c - program to generate functional surfaces
 *
 *      Parametric functions x(s,t), y(s,t) and z(s,t)
 *  specify the surface, which is tesselated into an m by n
 *  array of paired triangles.
 *      The surface normal is defined by the right hand
 *  rule applied to (s,t).
 *
 *      4/3/87
 *
 *      4/16/02 Added conditional vertex output
 */

#include  "standard.h"

#include  "paths.h"
#include  "resolu.h"
#include  "rterror.h"
#include  "calcomp.h"

char  XNAME[] =         "X`SYS";                /* x function name */
char  YNAME[] =         "Y`SYS";                /* y function name */
char  ZNAME[] =         "Z`SYS";                /* z function name */

char  VNAME[] =         "valid";                /* valid vertex name */

#define  ABS(x)         ((x)>=0 ? (x) : -(x))

#define  ZEROVECT(v)    (DOT(v,v) <= FTINY*FTINY)

#define  pvect(p)       printf(vformat, (p)[0], (p)[1], (p)[2])

char  vformat[] = "%18.12g %18.12g %18.12g\n";
char  tsargs[] = "4 surf_dx surf_dy surf_dz surf.cal";
char  texname[] = "Phong";

int  smooth = 0;                /* apply smoothing? */
int  objout = 0;                /* output .OBJ format? */
int  rev = 0;                   /* invert normal directions? */

char  *modname, *surfname;

                                /* recorded data flags */
#define  HASBORDER      01
#define  TRIPLETS       02
                                /* a data structure */
struct {
        int     flags;                  /* data type */
        short   m, n;                   /* number of s and t values */
        RREAL   *data;                  /* the data itself, s major sort */
} datarec;                      /* our recorded data */

/* XXX this is redundant with rt/noise3.c, should go to a library */
double  l_hermite(), l_bezier(), l_bspline(), l_dataval();

typedef struct {
        int  valid;     /* point is valid (vertex number) */
        int  nvalid;    /* normal is valid (normal number) */
        FVECT  p;       /* vertex position */
        FVECT  n;       /* average normal */
        RREAL  uv[2];   /* (u,v) position */
} POINT;

int  nverts = 0;                /* vertex output count */
int  nnorms = 0;                /* normal output count */

void loaddata(char *file, int m, int n, int pointsize);
double l_dataval(char *nam);
void putobjrow(POINT *rp, int n);
void putobjvert(POINT *p);
void putsquare(POINT *p0, POINT *p1, POINT *p2, POINT *p3);
void comprow(double s, POINT *row, int siz);
void compnorms(POINT *r0, POINT *r1, POINT *r2, int siz);
int norminterp(FVECT resmat[4], POINT *p0, POINT *p1, POINT *p2, POINT *p3);


int
main(int argc, char *argv[])
{
        POINT  *row0, *row1, *row2, *rp;
        int  i, j, m, n;
        char  stmp[256];

        esupport |= E_VARIABLE|E_FUNCTION|E_RCONST;
        esupport &= ~(E_OUTCHAN|E_INCHAN);
        varset("PI", ':', PI);
        funset("hermite", 5, ':', l_hermite);
        funset("bezier", 5, ':', l_bezier);
        funset("bspline", 5, ':', l_bspline);

        if (argc < 8)
                goto userror;

        for (i = 8; i < argc; i++)
                if (!strcmp(argv[i], "-e"))
                        scompile(argv[++i], NULL, 0);
                else if (!strcmp(argv[i], "-f")) {
                        char  *fpath = getpath(argv[++i], getrlibpath(), 0);
                        if (fpath == NULL) {
                                fprintf(stderr, "%s: cannot find file '%s'\n",
                                                argv[0], argv[i]);
                                quit(1);
                        }
                        fcompile(fpath);
                } else if (!strcmp(argv[i], "-s"))
                        smooth++;
                else if (!strcmp(argv[i], "-o"))
                        objout++;
                else if (!strcmp(argv[i], "-i"))
                        rev = 1;
                else
                        goto userror;

        modname = argv[1];
        surfname = argv[2];
        m = eval(argv[6]) + .5;
        n = eval(argv[7]) + .5;
        if (m <= 0 || n <= 0)
                goto userror;
        if (!strcmp(argv[5], "-") || access(argv[5], 4) == 0) { /* file? */
                funset(ZNAME, 2, ':', l_dataval);
                if (!strcmp(argv[5],argv[3]) && !strcmp(argv[5],argv[4])) {
                        loaddata(argv[5], m, n, 3);
                        funset(XNAME, 2, ':', l_dataval);
                        funset(YNAME, 2, ':', l_dataval);
                } else {
                        loaddata(argv[5], m, n, 1);
                        sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]);
                        scompile(stmp, NULL, 0);
                        sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]);
                        scompile(stmp, NULL, 0);
                }
        } else {
                sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]);
                scompile(stmp, NULL, 0);
                sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]);
                scompile(stmp, NULL, 0);
                sprintf(stmp, "%s(s,t)=%s;", ZNAME, argv[5]);
                scompile(stmp, NULL, 0);
        }
        row0 = (POINT *)malloc((n+3)*sizeof(POINT));
        row1 = (POINT *)malloc((n+3)*sizeof(POINT));
        row2 = (POINT *)malloc((n+3)*sizeof(POINT));
        if (row0 == NULL || row1 == NULL || row2 == NULL) {
                fprintf(stderr, "%s: out of memory\n", argv[0]);
                quit(1);
        }
        row0++; row1++; row2++;
                                                /* print header */
        fputs("# ", stdout);
        printargs(argc, argv, stdout);
        doptimize(1);
        eclock++;
                                                /* initialize */
        comprow(-1.0/m, row0, n);
        comprow(0.0, row1, n);
        comprow(1.0/m, row2, n);
        compnorms(row0, row1, row2, n);
        if (objout) {
                printf("\nusemtl %s\n\n", modname);
                printf("o %s\n\n", surfname);
                putobjrow(row1, n);
        }
                                                /* for each row */
        for (i = 0; i < m; i++) {
                                                /* compute next row */
                rp = row0;
                row0 = row1;
                row1 = row2;
                row2 = rp;
                comprow((double)(i+2)/m, row2, n);
                compnorms(row0, row1, row2, n);
                if (objout)
                        putobjrow(row1, n);

                for (j = 0; j < n; j++) {
                        int  orient = (j & 1);
                                                        /* put polygons */
                        if (!(row0[j].valid && row1[j+1].valid))
                                orient = 1;
                        else if (!(row1[j].valid && row0[j+1].valid))
                                orient = 0;
                        if (orient)
                                putsquare(&row0[j], &row1[j],
                                                &row0[j+1], &row1[j+1]);
                        else
                                putsquare(&row1[j], &row1[j+1],
                                                &row0[j], &row0[j+1]);
                }
        }

        return 0;

userror:
        fprintf(stderr, "Usage: %s material name ", argv[0]);
        fprintf(stderr, "x(s,t) y(s,t) z(s,t) m n [-s][-o][-e expr][-f file]\n");
        return 1;
}


void
loaddata(               /* load point data from file */
        char  *file,
        int  m,
        int  n,
        int  pointsize
)
{
        FILE  *fp;
        char  word[64];
        int  size;
        RREAL  *dp;

        datarec.flags = HASBORDER;              /* assume border values */
        datarec.m = m+1;
        datarec.n = n+1;
        size = datarec.m*datarec.n*pointsize;
        if (pointsize == 3)
                datarec.flags |= TRIPLETS;
        dp = (RREAL *)malloc(size*sizeof(RREAL));
        if ((datarec.data = dp) == NULL) {
                fputs("Out of memory\n", stderr);
                exit(1);
        }
        if (!strcmp(file, "-")) {
                file = "<stdin>";
                fp = stdin;
        } else if ((fp = fopen(file, "r")) == NULL) {
                fputs(file, stderr);
                fputs(": cannot open\n", stderr);
                exit(1);
        }
        while (size > 0 && fgetword(word, sizeof(word), fp) != NULL) {
                if (!isflt(word)) {
                        fprintf(stderr, "%s: garbled data value: %s\n",
                                        file, word);
                        exit(1);
                }
                *dp++ = atof(word);
                size--;
        }
        if (size == (m+n+1)*pointsize) {        /* no border after all */
                dp = (RREAL *)realloc(datarec.data,
                                m*n*pointsize*sizeof(RREAL));
                if (dp != NULL)
                        datarec.data = dp;
                datarec.flags &= ~HASBORDER;
                datarec.m = m;
                datarec.n = n;
                size = 0;
        }
        if (datarec.m < 2 || datarec.n < 2 || size != 0 ||
                        fgetword(word, sizeof(word), fp) != NULL) {
                fputs(file, stderr);
                fputs(": bad number of data points\n", stderr);
                exit(1);
        }
        fclose(fp);
}


double
l_dataval(                              /* return recorded data value */
        char  *nam
)
{
        double  u, v;
        int  i, j;
        RREAL  *dp;
        double  d00, d01, d10, d11;
                                                /* compute coordinates */
        u = argument(1); v = argument(2);
        if (datarec.flags & HASBORDER) {
                i = u *= datarec.m-1;
                j = v *= datarec.n-1;
        } else {
                i = u = u*datarec.m - .5;
                j = v = v*datarec.n - .5;
        }
        if (i < 0) i = 0;
        else if (i > datarec.m-2) i = datarec.m-2;
        if (j < 0) j = 0;
        else if (j > datarec.n-2) j = datarec.n-2;
                                                /* compute value */
        if (datarec.flags & TRIPLETS) {
                dp = datarec.data + 3*(j*datarec.m + i);
                if (nam == ZNAME)
                        dp += 2;
                else if (nam == YNAME)
                        dp++;
                d00 = dp[0]; d01 = dp[3];
                dp += 3*datarec.m;
                d10 = dp[0]; d11 = dp[3];
        } else {
                dp = datarec.data + j*datarec.m + i;
                d00 = dp[0]; d01 = dp[1];
                dp += datarec.m;
                d10 = dp[0]; d11 = dp[1];
        }
                                                /* bilinear interpolation */
        return((j+1-v)*((i+1-u)*d00+(u-i)*d01)+(v-j)*((i+1-u)*d10+(u-i)*d11));
}


void
putobjrow(                      /* output vertex row to .OBJ */
        POINT  *rp,
        int  n
)
{
        static FVECT  prevNorm;

        for ( ; n-- >= 0; rp++) {
                if (!rp->valid)
                        continue;
                fputs("v ", stdout);
                pvect(rp->p);
                rp->valid = ++nverts;
                printf("\tvt %.9g %.9g\n", rp->uv[0], rp->uv[1]);
                if (!smooth || ZEROVECT(rp->n))
                        rp->nvalid = 0;
                else if (VABSEQ(rp->n, prevNorm))
                        rp->nvalid = nnorms;
                else {
                        printf("\tvn %.9g %.9g %.9g\n",
                                        rp->n[0], rp->n[1], rp->n[2]);
                        rp->nvalid = ++nnorms;
                        VCOPY(prevNorm, rp->n);
                }
        }
}


void
putobjvert(             /* put out OBJ vertex index triplet */
        POINT *p
)
{
        int     pti = p->valid ? p->valid-nverts-1 : 0;
        int     ni = p->nvalid ? p->nvalid-nnorms-1 : 0;
        
        printf(" %d/%d/%d", pti, pti, ni);
}


void
putsquare(              /* put out a square */
        POINT *p0,
        POINT *p1,
        POINT *p2,
        POINT *p3
)
{
        static int  nout = 0;
        FVECT  norm[4];
        int  axis;
        FVECT  v1, v2, vc1, vc2;
        int  ok1, ok2;

        if (rev) {                      /* reverse normals? */
                POINT  *pt = p1; p1 = p2; p2 = pt;
        }
                                        /* compute exact normals */
        ok1 = (p0->valid && p1->valid && p2->valid);
        if (ok1) {
                VSUB(v1, p1->p, p0->p);
                VSUB(v2, p2->p, p0->p);
                fcross(vc1, v1, v2);
                ok1 = (normalize(vc1) != 0.0);
        }
        ok2 = (p1->valid && p2->valid && p3->valid);
        if (ok2) {
                VSUB(v1, p2->p, p3->p);
                VSUB(v2, p1->p, p3->p);
                fcross(vc2, v1, v2);
                ok2 = (normalize(vc2) != 0.0);
        }
        if (!(ok1 | ok2))
                return;
        if (objout) {                   /* output .OBJ faces */
                if (ok1 & ok2 && fdot(vc1,vc2) >= 1.0-FTINY*FTINY) {
                        putc('f', stdout);
                        putobjvert(p0); putobjvert(p1);
                        putobjvert(p3); putobjvert(p2);
                        putc('\n', stdout);
                        return;
                }
                if (ok1) {
                        putc('f', stdout);
                        putobjvert(p0); putobjvert(p1); putobjvert(p2);
                        putc('\n', stdout);
                }
                if (ok2) {
                        putc('f', stdout);
                        putobjvert(p2); putobjvert(p1); putobjvert(p3);
                        putc('\n', stdout);
                }
                return;
        }
                                        /* compute normal interpolation */
        axis = norminterp(norm, p0, p1, p2, p3);

                                        /* put out quadrilateral? */
        if (ok1 & ok2 && fdot(vc1,vc2) >= 1.0-FTINY*FTINY) {
                printf("\n%s ", modname);
                if (axis != -1) {
                        printf("texfunc %s\n%s\n", texname, tsargs);
                        printf("0\n13\t%d\n", axis);
                        pvect(norm[0]);
                        pvect(norm[1]);
                        pvect(norm[2]);
                        fvsum(v1, norm[3], vc1, -0.5);
                        fvsum(v1, v1, vc2, -0.5);
                        pvect(v1);
                        printf("\n%s ", texname);
                }
                printf("polygon %s.%d\n", surfname, ++nout);
                printf("0\n0\n12\n");
                pvect(p0->p);
                pvect(p1->p);
                pvect(p3->p);
                pvect(p2->p);
                return;
        }
                                        /* put out triangles? */
        if (ok1) {
                printf("\n%s ", modname);
                if (axis != -1) {
                        printf("texfunc %s\n%s\n", texname, tsargs);
                        printf("0\n13\t%d\n", axis);
                        pvect(norm[0]);
                        pvect(norm[1]);
                        pvect(norm[2]);
                        fvsum(v1, norm[3], vc1, -1.0);
                        pvect(v1);
                        printf("\n%s ", texname);
                }
                printf("polygon %s.%d\n", surfname, ++nout);
                printf("0\n0\n9\n");
                pvect(p0->p);
                pvect(p1->p);
                pvect(p2->p);
        }
        if (ok2) {
                printf("\n%s ", modname);
                if (axis != -1) {
                        printf("texfunc %s\n%s\n", texname, tsargs);
                        printf("0\n13\t%d\n", axis);
                        pvect(norm[0]);
                        pvect(norm[1]);
                        pvect(norm[2]);
                        fvsum(v2, norm[3], vc2, -1.0);
                        pvect(v2);
                        printf("\n%s ", texname);
                }
                printf("polygon %s.%d\n", surfname, ++nout);
                printf("0\n0\n9\n");
                pvect(p2->p);
                pvect(p1->p);
                pvect(p3->p);
        }
}


void
comprow(                        /* compute row of values */
        double  s,
        POINT  *row,
        int  siz
)
{
        double  st[2];
        int  end;
        int  checkvalid;
        int  i;
        
        if (smooth) {
                i = -1;                 /* compute one past each end */
                end = siz+1;
        } else {
                if (s < -FTINY || s > 1.0+FTINY)
                        return;
                i = 0;
                end = siz;
        }
        st[0] = s;
        checkvalid = (fundefined(VNAME) == 2);
        while (i <= end) {
                st[1] = (double)i/siz;
                if (checkvalid && funvalue(VNAME, 2, st) <= 0.0) {
                        row[i].valid = 0;
                        row[i].p[0] = row[i].p[1] = row[i].p[2] = 0.0;
                        row[i].uv[0] = row[i].uv[1] = 0.0;
                } else {
                        row[i].valid = 1;
                        row[i].p[0] = funvalue(XNAME, 2, st);
                        row[i].p[1] = funvalue(YNAME, 2, st);
                        row[i].p[2] = funvalue(ZNAME, 2, st);
                        row[i].uv[0] = st[0];
                        row[i].uv[1] = st[1];
                }
                i++;
        }
}


void
compnorms(              /* compute row of averaged normals */
        POINT  *r0,
        POINT  *r1,
        POINT  *r2,
        int  siz
)
{
        FVECT  v1, v2;

        if (!smooth)                    /* not needed if no smoothing */
                return;
                                        /* compute row 1 normals */
        while (siz-- >= 0) {
                if (!r1[0].valid)
                        goto skip;
                if (!r0[0].valid) {
                        if (!r2[0].valid) {
                                r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0;
                                goto skip;
                        }
                        fvsum(v1, r2[0].p, r1[0].p, -1.0);
                } else if (!r2[0].valid)
                        fvsum(v1, r1[0].p, r0[0].p, -1.0);
                else
                        fvsum(v1, r2[0].p, r0[0].p, -1.0);
                if (!r1[-1].valid) {
                        if (!r1[1].valid) {
                                r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0;
                                goto skip;
                        }
                        fvsum(v2, r1[1].p, r1[0].p, -1.0);
                } else if (!r1[1].valid)
                        fvsum(v2, r1[0].p, r1[-1].p, -1.0);
                else
                        fvsum(v2, r1[1].p, r1[-1].p, -1.0);
                if (rev)
                        fcross(r1[0].n, v2, v1);
                else
                        fcross(r1[0].n, v1, v2);
                normalize(r1[0].n);
        skip:
                r0++; r1++; r2++;
        }
}


int
norminterp(     /* compute normal interpolation */
        FVECT  resmat[4],
        POINT  *p0,
        POINT  *p1,
        POINT  *p2,
        POINT  *p3
)
{
#define u  ((ax+1)%3)
#define v  ((ax+2)%3)

        int  ax;
        MAT4  eqnmat;
        FVECT  v1;
        int  i, j;

        if (!smooth)                    /* no interpolation if no smoothing */
                return(-1);
                                        /* find dominant axis */
        VCOPY(v1, p0->n);
        fvsum(v1, v1, p1->n, 1.0);
        fvsum(v1, v1, p2->n, 1.0);
        fvsum(v1, v1, p3->n, 1.0);
        ax = ABS(v1[0]) > ABS(v1[1]) ? 0 : 1;
        ax = ABS(v1[ax]) > ABS(v1[2]) ? ax : 2;
                                        /* assign equation matrix */
        eqnmat[0][0] = p0->p[u]*p0->p[v];
        eqnmat[0][1] = p0->p[u];
        eqnmat[0][2] = p0->p[v];
        eqnmat[0][3] = 1.0;
        eqnmat[1][0] = p1->p[u]*p1->p[v];
        eqnmat[1][1] = p1->p[u];
        eqnmat[1][2] = p1->p[v];
        eqnmat[1][3] = 1.0;
        eqnmat[2][0] = p2->p[u]*p2->p[v];
        eqnmat[2][1] = p2->p[u];
        eqnmat[2][2] = p2->p[v];
        eqnmat[2][3] = 1.0;
        eqnmat[3][0] = p3->p[u]*p3->p[v];
        eqnmat[3][1] = p3->p[u];
        eqnmat[3][2] = p3->p[v];
        eqnmat[3][3] = 1.0;
                                        /* invert matrix (solve system) */
        if (!invmat4(eqnmat, eqnmat))
                return(-1);                     /* no solution */
                                        /* compute result matrix */
        for (j = 0; j < 4; j++)
                for (i = 0; i < 3; i++)
                        resmat[j][i] =  eqnmat[j][0]*p0->n[i] +
                                        eqnmat[j][1]*p1->n[i] +
                                        eqnmat[j][2]*p2->n[i] +
                                        eqnmat[j][3]*p3->n[i];
        return(ax);

#undef u
#undef v
}


double
l_hermite(char *nm)
{
        double  t;
        
        t = argument(5);
        return( argument(1)*((2.0*t-3.0)*t*t+1.0) +
                argument(2)*(-2.0*t+3.0)*t*t +
                argument(3)*((t-2.0)*t+1.0)*t +
                argument(4)*(t-1.0)*t*t );
}


double
l_bezier(char *nm)
{
        double  t;

        t = argument(5);
        return( argument(1) * (1.+t*(-3.+t*(3.-t))) +
                argument(2) * 3.*t*(1.+t*(-2.+t)) +
                argument(3) * 3.*t*t*(1.-t) +
                argument(4) * t*t*t );
}


double
l_bspline(char *nm)
{
        double  t;

        t = argument(5);
        return( argument(1) * (1./6.+t*(-1./2.+t*(1./2.-1./6.*t))) +
                argument(2) * (2./3.+t*t*(-1.+1./2.*t)) +
                argument(3) * (1./6.+t*(1./2.+t*(1./2.-1./2.*t))) +
                argument(4) * (1./6.*t*t*t) );
}
Revision:	2.32
Committed:	Fri Apr 18 23:02:53 2025 UTC (2 weeks, 2 days ago) by greg
Content type:	text/plain
Branch:	MAIN
Changes since 2.31:	+3 -2 lines
Log Message:	perf(gensurf,genrev,genworm): Added call to doptimize() for expressions
#	User	Rev	Content
1	greg	1.1	#ifndef lint
2	greg	2.32	static const char RCSid[] = "$Id: gensurf.c,v 2.31 2025/01/21 01:56:27 greg Exp $";
3	greg	1.1	#endif
4	greg	1.2	/*
5	greg	1.1	* gensurf.c - program to generate functional surfaces
6			*
7			* Parametric functions x(s,t), y(s,t) and z(s,t)
8			* specify the surface, which is tesselated into an m by n
9			* array of paired triangles.
10			* The surface normal is defined by the right hand
11			* rule applied to (s,t).
12			*
13			* 4/3/87
14	greg	2.6	*
15			* 4/16/02 Added conditional vertex output
16	greg	1.1	*/
17
18	greg	2.14	#include "standard.h"
19	schorsch	2.15
20			#include "paths.h"
21	greg	2.16	#include "resolu.h"
22			#include "rterror.h"
23	schorsch	2.13	#include "calcomp.h"
24	greg	1.1
25	greg	2.6	char XNAME[] = "X`SYS"; /* x function name */
26			char YNAME[] = "Y`SYS"; /* y function name */
27			char ZNAME[] = "Z`SYS"; /* z function name */
28
29			char VNAME[] = "valid"; /* valid vertex name */
30	greg	1.1
31	greg	1.4	#define ABS(x) ((x)>=0 ? (x) : -(x))
32
33	greg	2.9	#define ZEROVECT(v) (DOT(v,v) <= FTINY*FTINY)
34
35	greg	1.3	#define pvect(p) printf(vformat, (p)[0], (p)[1], (p)[2])
36	greg	1.1
37	greg	2.18	char vformat[] = "%18.12g %18.12g %18.12g\n";
38	greg	2.19	char tsargs[] = "4 surf_dx surf_dy surf_dz surf.cal";
39	greg	1.3	char texname[] = "Phong";
40	greg	1.1
41	greg	1.3	int smooth = 0; /* apply smoothing? */
42	greg	2.7	int objout = 0; /* output .OBJ format? */
43	greg	2.31	int rev = 0; /* invert normal directions? */
44	greg	1.1
45	greg	1.3	char modname, surfname;
46	greg	1.1
47	greg	2.2	/* recorded data flags */
48			#define HASBORDER 01
49			#define TRIPLETS 02
50			/* a data structure */
51			struct {
52			int flags; /* data type */
53			short m, n; /* number of s and t values */
54	schorsch	2.11	RREAL data; / the data itself, s major sort */
55	greg	2.2	} datarec; /* our recorded data */
56	greg	1.3
57	schorsch	2.13	/* XXX this is redundant with rt/noise3.c, should go to a library */
58	greg	2.2	double l_hermite(), l_bezier(), l_bspline(), l_dataval();
59
60	greg	1.3	typedef struct {
61	greg	2.7	int valid; /* point is valid (vertex number) */
62	greg	2.29	int nvalid; /* normal is valid (normal number) */
63	greg	1.3	FVECT p; /* vertex position */
64			FVECT n; /* average normal */
65	schorsch	2.11	RREAL uv[2]; /* (u,v) position */
66	greg	1.3	} POINT;
67
68	greg	2.23	int nverts = 0; /* vertex output count */
69			int nnorms = 0; /* normal output count */
70	greg	1.3
71	schorsch	2.13	void loaddata(char *file, int m, int n, int pointsize);
72			double l_dataval(char *nam);
73			void putobjrow(POINT *rp, int n);
74	greg	2.23	void putobjvert(POINT *p);
75	schorsch	2.13	void putsquare(POINT p0, POINT p1, POINT p2, POINT p3);
76			void comprow(double s, POINT *row, int siz);
77			void compnorms(POINT r0, POINT r1, POINT *r2, int siz);
78			int norminterp(FVECT resmat[4], POINT p0, POINT p1, POINT p2, POINT p3);
79
80
81			int
82	greg	2.28	main(int argc, char *argv[])
83	greg	1.1	{
84	greg	1.3	POINT row0, row1, row2, rp;
85	greg	1.1	int i, j, m, n;
86			char stmp[256];
87
88	greg	2.24	esupport \|= E_VARIABLE\|E_FUNCTION\|E_RCONST;
89			esupport &= ~(E_OUTCHAN\|E_INCHAN);
90	greg	1.13	varset("PI", ':', PI);
91	greg	1.14	funset("hermite", 5, ':', l_hermite);
92			funset("bezier", 5, ':', l_bezier);
93			funset("bspline", 5, ':', l_bspline);
94	greg	1.1
95			if (argc < 8)
96			goto userror;
97
98			for (i = 8; i < argc; i++)
99			if (!strcmp(argv[i], "-e"))
100	greg	1.10	scompile(argv[++i], NULL, 0);
101	greg	2.25	else if (!strcmp(argv[i], "-f")) {
102			char *fpath = getpath(argv[++i], getrlibpath(), 0);
103			if (fpath == NULL) {
104			fprintf(stderr, "%s: cannot find file '%s'\n",
105			argv[0], argv[i]);
106			quit(1);
107			}
108			fcompile(fpath);
109			} else if (!strcmp(argv[i], "-s"))
110	greg	1.3	smooth++;
111	greg	2.7	else if (!strcmp(argv[i], "-o"))
112			objout++;
113	greg	2.31	else if (!strcmp(argv[i], "-i"))
114			rev = 1;
115	greg	1.1	else
116			goto userror;
117
118	greg	1.3	modname = argv[1];
119			surfname = argv[2];
120	greg	2.26	m = eval(argv[6]) + .5;
121			n = eval(argv[7]) + .5;
122	greg	1.1	if (m <= 0 \|\| n <= 0)
123			goto userror;
124	greg	2.2	if (!strcmp(argv[5], "-") \|\| access(argv[5], 4) == 0) { /* file? */
125			funset(ZNAME, 2, ':', l_dataval);
126			if (!strcmp(argv[5],argv[3]) && !strcmp(argv[5],argv[4])) {
127			loaddata(argv[5], m, n, 3);
128			funset(XNAME, 2, ':', l_dataval);
129			funset(YNAME, 2, ':', l_dataval);
130			} else {
131			loaddata(argv[5], m, n, 1);
132			sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]);
133			scompile(stmp, NULL, 0);
134			sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]);
135			scompile(stmp, NULL, 0);
136			}
137			} else {
138			sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]);
139			scompile(stmp, NULL, 0);
140			sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]);
141			scompile(stmp, NULL, 0);
142			sprintf(stmp, "%s(s,t)=%s;", ZNAME, argv[5]);
143			scompile(stmp, NULL, 0);
144			}
145	greg	1.4	row0 = (POINT )malloc((n+3)sizeof(POINT));
146			row1 = (POINT )malloc((n+3)sizeof(POINT));
147			row2 = (POINT )malloc((n+3)sizeof(POINT));
148	greg	1.3	if (row0 == NULL \|\| row1 == NULL \|\| row2 == NULL) {
149	greg	1.1	fprintf(stderr, "%s: out of memory\n", argv[0]);
150			quit(1);
151			}
152	greg	1.4	row0++; row1++; row2++;
153	greg	1.3	/* print header */
154	greg	2.16	fputs("# ", stdout);
155			printargs(argc, argv, stdout);
156	greg	2.32	doptimize(1);
157			eclock++;
158	greg	1.4	/* initialize */
159			comprow(-1.0/m, row0, n);
160	greg	1.3	comprow(0.0, row1, n);
161			comprow(1.0/m, row2, n);
162	greg	1.4	compnorms(row0, row1, row2, n);
163	greg	2.8	if (objout) {
164			printf("\nusemtl %s\n\n", modname);
165	greg	2.28	printf("o %s\n\n", surfname);
166	greg	2.7	putobjrow(row1, n);
167	greg	2.8	}
168	greg	1.3	/* for each row */
169	greg	1.1	for (i = 0; i < m; i++) {
170			/* compute next row */
171	greg	1.3	rp = row0;
172	greg	1.1	row0 = row1;
173	greg	1.3	row1 = row2;
174			row2 = rp;
175	greg	1.4	comprow((double)(i+2)/m, row2, n);
176			compnorms(row0, row1, row2, n);
177	greg	2.7	if (objout)
178			putobjrow(row1, n);
179	greg	1.1
180			for (j = 0; j < n; j++) {
181	greg	2.6	int orient = (j & 1);
182	greg	1.3	/* put polygons */
183	greg	2.7	if (!(row0[j].valid && row1[j+1].valid))
184	greg	2.6	orient = 1;
185	greg	2.7	else if (!(row1[j].valid && row0[j+1].valid))
186	greg	2.6	orient = 0;
187			if (orient)
188	greg	1.3	putsquare(&row0[j], &row1[j],
189			&row0[j+1], &row1[j+1]);
190			else
191			putsquare(&row1[j], &row1[j+1],
192			&row0[j], &row0[j+1]);
193	greg	1.1	}
194			}
195
196	schorsch	2.13	return 0;
197	greg	1.1
198			userror:
199			fprintf(stderr, "Usage: %s material name ", argv[0]);
200	greg	2.17	fprintf(stderr, "x(s,t) y(s,t) z(s,t) m n [-s][-o][-e expr][-f file]\n");
201	schorsch	2.13	return 1;
202	greg	2.2	}
203
204
205	schorsch	2.13	void
206			loaddata( /* load point data from file */
207			char *file,
208			int m,
209			int n,
210			int pointsize
211			)
212	greg	2.2	{
213			FILE *fp;
214			char word[64];
215	greg	2.22	int size;
216			RREAL *dp;
217	greg	2.2
218			datarec.flags = HASBORDER; /* assume border values */
219	greg	2.3	datarec.m = m+1;
220			datarec.n = n+1;
221			size = datarec.mdatarec.npointsize;
222	greg	2.2	if (pointsize == 3)
223			datarec.flags \|= TRIPLETS;
224	schorsch	2.11	dp = (RREAL )malloc(sizesizeof(RREAL));
225	greg	2.2	if ((datarec.data = dp) == NULL) {
226			fputs("Out of memory\n", stderr);
227			exit(1);
228			}
229			if (!strcmp(file, "-")) {
230			file = "<stdin>";
231			fp = stdin;
232			} else if ((fp = fopen(file, "r")) == NULL) {
233			fputs(file, stderr);
234			fputs(": cannot open\n", stderr);
235			exit(1);
236			}
237			while (size > 0 && fgetword(word, sizeof(word), fp) != NULL) {
238			if (!isflt(word)) {
239			fprintf(stderr, "%s: garbled data value: %s\n",
240			file, word);
241			exit(1);
242			}
243			*dp++ = atof(word);
244			size--;
245			}
246			if (size == (m+n+1)pointsize) { / no border after all */
247	greg	2.20	dp = (RREAL *)realloc(datarec.data,
248	schorsch	2.11	mnpointsize*sizeof(RREAL));
249	greg	2.2	if (dp != NULL)
250			datarec.data = dp;
251			datarec.flags &= ~HASBORDER;
252	greg	2.3	datarec.m = m;
253			datarec.n = n;
254	greg	2.2	size = 0;
255			}
256	greg	2.3	if (datarec.m < 2 \|\| datarec.n < 2 \|\| size != 0 \|\|
257			fgetword(word, sizeof(word), fp) != NULL) {
258	greg	2.2	fputs(file, stderr);
259			fputs(": bad number of data points\n", stderr);
260			exit(1);
261			}
262			fclose(fp);
263			}
264
265
266			double
267	schorsch	2.13	l_dataval( /* return recorded data value */
268			char *nam
269			)
270	greg	2.2	{
271			double u, v;
272	greg	2.22	int i, j;
273			RREAL *dp;
274	greg	2.2	double d00, d01, d10, d11;
275			/* compute coordinates */
276			u = argument(1); v = argument(2);
277			if (datarec.flags & HASBORDER) {
278	greg	2.3	i = u *= datarec.m-1;
279			j = v *= datarec.n-1;
280	greg	2.2	} else {
281	greg	2.3	i = u = u*datarec.m - .5;
282			j = v = v*datarec.n - .5;
283	greg	2.2	}
284			if (i < 0) i = 0;
285			else if (i > datarec.m-2) i = datarec.m-2;
286			if (j < 0) j = 0;
287			else if (j > datarec.n-2) j = datarec.n-2;
288			/* compute value */
289			if (datarec.flags & TRIPLETS) {
290	greg	2.3	dp = datarec.data + 3(jdatarec.m + i);
291			if (nam == ZNAME)
292			dp += 2;
293			else if (nam == YNAME)
294	greg	2.2	dp++;
295			d00 = dp[0]; d01 = dp[3];
296	greg	2.3	dp += 3*datarec.m;
297	greg	2.2	d10 = dp[0]; d11 = dp[3];
298			} else {
299	greg	2.3	dp = datarec.data + j*datarec.m + i;
300	greg	2.2	d00 = dp[0]; d01 = dp[1];
301	greg	2.3	dp += datarec.m;
302	greg	2.2	d10 = dp[0]; d11 = dp[1];
303			}
304			/* bilinear interpolation */
305			return((j+1-v)((i+1-u)d00+(u-i)d01)+(v-j)((i+1-u)d10+(u-i)d11));
306	greg	1.1	}
307
308
309	schorsch	2.13	void
310			putobjrow( /* output vertex row to .OBJ */
311	greg	2.22	POINT *rp,
312	schorsch	2.13	int n
313			)
314	greg	2.7	{
315	greg	2.29	static FVECT prevNorm;
316
317	greg	2.7	for ( ; n-- >= 0; rp++) {
318			if (!rp->valid)
319			continue;
320			fputs("v ", stdout);
321	greg	2.9	pvect(rp->p);
322	greg	2.29	rp->valid = ++nverts;
323			printf("\tvt %.9g %.9g\n", rp->uv[0], rp->uv[1]);
324			if (!smooth \|\| ZEROVECT(rp->n))
325			rp->nvalid = 0;
326			else if (VABSEQ(rp->n, prevNorm))
327			rp->nvalid = nnorms;
328			else {
329	greg	2.7	printf("\tvn %.9g %.9g %.9g\n",
330			rp->n[0], rp->n[1], rp->n[2]);
331	greg	2.21	rp->nvalid = ++nnorms;
332	greg	2.29	VCOPY(prevNorm, rp->n);
333			}
334	greg	2.7	}
335			}
336
337
338	schorsch	2.13	void
339	greg	2.23	putobjvert( /* put out OBJ vertex index triplet */
340			POINT *p
341			)
342			{
343			int pti = p->valid ? p->valid-nverts-1 : 0;
344			int ni = p->nvalid ? p->nvalid-nnorms-1 : 0;
345
346			printf(" %d/%d/%d", pti, pti, ni);
347			}
348
349
350			void
351	schorsch	2.13	putsquare( /* put out a square */
352			POINT *p0,
353			POINT *p1,
354			POINT *p2,
355			POINT *p3
356			)
357	greg	1.3	{
358			static int nout = 0;
359			FVECT norm[4];
360			int axis;
361			FVECT v1, v2, vc1, vc2;
362			int ok1, ok2;
363	greg	2.31
364			if (rev) { /* reverse normals? */
365			POINT *pt = p1; p1 = p2; p2 = pt;
366			}
367	greg	1.3	/* compute exact normals */
368	greg	2.7	ok1 = (p0->valid && p1->valid && p2->valid);
369	greg	2.6	if (ok1) {
370	greg	2.9	VSUB(v1, p1->p, p0->p);
371			VSUB(v2, p2->p, p0->p);
372	greg	2.6	fcross(vc1, v1, v2);
373			ok1 = (normalize(vc1) != 0.0);
374			}
375	greg	2.7	ok2 = (p1->valid && p2->valid && p3->valid);
376	greg	2.6	if (ok2) {
377	greg	2.9	VSUB(v1, p2->p, p3->p);
378			VSUB(v2, p1->p, p3->p);
379	greg	2.6	fcross(vc2, v1, v2);
380			ok2 = (normalize(vc2) != 0.0);
381			}
382	greg	1.3	if (!(ok1 \| ok2))
383			return;
384	greg	2.7	if (objout) { /* output .OBJ faces */
385			if (ok1 & ok2 && fdot(vc1,vc2) >= 1.0-FTINY*FTINY) {
386	greg	2.23	putc('f', stdout);
387			putobjvert(p0); putobjvert(p1);
388			putobjvert(p3); putobjvert(p2);
389			putc('\n', stdout);
390	greg	2.7	return;
391			}
392	greg	2.23	if (ok1) {
393			putc('f', stdout);
394			putobjvert(p0); putobjvert(p1); putobjvert(p2);
395			putc('\n', stdout);
396			}
397			if (ok2) {
398			putc('f', stdout);
399			putobjvert(p2); putobjvert(p1); putobjvert(p3);
400			putc('\n', stdout);
401			}
402	greg	2.7	return;
403			}
404	greg	1.3	/* compute normal interpolation */
405			axis = norminterp(norm, p0, p1, p2, p3);
406
407			/* put out quadrilateral? */
408			if (ok1 & ok2 && fdot(vc1,vc2) >= 1.0-FTINY*FTINY) {
409			printf("\n%s ", modname);
410			if (axis != -1) {
411	greg	2.19	printf("texfunc %s\n%s\n", texname, tsargs);
412	greg	1.3	printf("0\n13\t%d\n", axis);
413			pvect(norm[0]);
414			pvect(norm[1]);
415			pvect(norm[2]);
416			fvsum(v1, norm[3], vc1, -0.5);
417			fvsum(v1, v1, vc2, -0.5);
418			pvect(v1);
419			printf("\n%s ", texname);
420			}
421			printf("polygon %s.%d\n", surfname, ++nout);
422			printf("0\n0\n12\n");
423			pvect(p0->p);
424			pvect(p1->p);
425			pvect(p3->p);
426			pvect(p2->p);
427			return;
428			}
429			/* put out triangles? */
430			if (ok1) {
431			printf("\n%s ", modname);
432			if (axis != -1) {
433	greg	2.19	printf("texfunc %s\n%s\n", texname, tsargs);
434	greg	1.3	printf("0\n13\t%d\n", axis);
435			pvect(norm[0]);
436			pvect(norm[1]);
437			pvect(norm[2]);
438			fvsum(v1, norm[3], vc1, -1.0);
439			pvect(v1);
440			printf("\n%s ", texname);
441			}
442			printf("polygon %s.%d\n", surfname, ++nout);
443			printf("0\n0\n9\n");
444			pvect(p0->p);
445			pvect(p1->p);
446			pvect(p2->p);
447			}
448			if (ok2) {
449			printf("\n%s ", modname);
450			if (axis != -1) {
451	greg	2.19	printf("texfunc %s\n%s\n", texname, tsargs);
452	greg	1.3	printf("0\n13\t%d\n", axis);
453			pvect(norm[0]);
454			pvect(norm[1]);
455			pvect(norm[2]);
456			fvsum(v2, norm[3], vc2, -1.0);
457			pvect(v2);
458			printf("\n%s ", texname);
459			}
460			printf("polygon %s.%d\n", surfname, ++nout);
461			printf("0\n0\n9\n");
462			pvect(p2->p);
463			pvect(p1->p);
464			pvect(p3->p);
465			}
466			}
467
468
469	schorsch	2.13	void
470			comprow( /* compute row of values */
471			double s,
472	greg	2.22	POINT *row,
473	schorsch	2.13	int siz
474			)
475	greg	1.1	{
476	greg	1.4	double st[2];
477	greg	1.8	int end;
478	greg	2.6	int checkvalid;
479	greg	2.22	int i;
480	greg	1.8
481			if (smooth) {
482			i = -1; /* compute one past each end */
483			end = siz+1;
484			} else {
485			if (s < -FTINY \|\| s > 1.0+FTINY)
486			return;
487			i = 0;
488			end = siz;
489			}
490	greg	1.1	st[0] = s;
491	greg	2.6	checkvalid = (fundefined(VNAME) == 2);
492	greg	1.8	while (i <= end) {
493	greg	1.4	st[1] = (double)i/siz;
494	greg	2.6	if (checkvalid && funvalue(VNAME, 2, st) <= 0.0) {
495			row[i].valid = 0;
496			row[i].p[0] = row[i].p[1] = row[i].p[2] = 0.0;
497	greg	2.7	row[i].uv[0] = row[i].uv[1] = 0.0;
498	greg	2.6	} else {
499			row[i].valid = 1;
500			row[i].p[0] = funvalue(XNAME, 2, st);
501			row[i].p[1] = funvalue(YNAME, 2, st);
502			row[i].p[2] = funvalue(ZNAME, 2, st);
503	greg	2.7	row[i].uv[0] = st[0];
504			row[i].uv[1] = st[1];
505	greg	2.6	}
506	greg	1.8	i++;
507	greg	1.1	}
508	greg	1.3	}
509
510
511	schorsch	2.13	void
512			compnorms( /* compute row of averaged normals */
513	greg	2.22	POINT *r0,
514			POINT *r1,
515			POINT *r2,
516	schorsch	2.13	int siz
517			)
518	greg	1.3	{
519	greg	1.11	FVECT v1, v2;
520	greg	1.3
521			if (!smooth) /* not needed if no smoothing */
522			return;
523	greg	2.6	/* compute row 1 normals */
524	greg	1.4	while (siz-- >= 0) {
525	greg	2.6	if (!r1[0].valid)
526	greg	2.27	goto skip;
527	greg	2.6	if (!r0[0].valid) {
528			if (!r2[0].valid) {
529			r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0;
530	greg	2.27	goto skip;
531	greg	2.6	}
532			fvsum(v1, r2[0].p, r1[0].p, -1.0);
533			} else if (!r2[0].valid)
534			fvsum(v1, r1[0].p, r0[0].p, -1.0);
535			else
536			fvsum(v1, r2[0].p, r0[0].p, -1.0);
537			if (!r1[-1].valid) {
538			if (!r1[1].valid) {
539			r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0;
540	greg	2.27	goto skip;
541	greg	2.6	}
542			fvsum(v2, r1[1].p, r1[0].p, -1.0);
543			} else if (!r1[1].valid)
544			fvsum(v2, r1[0].p, r1[-1].p, -1.0);
545			else
546			fvsum(v2, r1[1].p, r1[-1].p, -1.0);
547	greg	2.31	if (rev)
548			fcross(r1[0].n, v2, v1);
549			else
550			fcross(r1[0].n, v1, v2);
551	greg	1.3	normalize(r1[0].n);
552	greg	2.27	skip:
553	greg	1.3	r0++; r1++; r2++;
554			}
555			}
556
557
558			int
559	schorsch	2.13	norminterp( /* compute normal interpolation */
560	greg	2.22	FVECT resmat[4],
561	schorsch	2.13	POINT *p0,
562			POINT *p1,
563			POINT *p2,
564			POINT *p3
565			)
566	greg	1.3	{
567			#define u ((ax+1)%3)
568			#define v ((ax+2)%3)
569
570	greg	2.22	int ax;
571	greg	1.12	MAT4 eqnmat;
572	greg	1.3	FVECT v1;
573	greg	2.22	int i, j;
574	greg	1.3
575			if (!smooth) /* no interpolation if no smoothing */
576			return(-1);
577			/* find dominant axis */
578			VCOPY(v1, p0->n);
579			fvsum(v1, v1, p1->n, 1.0);
580			fvsum(v1, v1, p2->n, 1.0);
581			fvsum(v1, v1, p3->n, 1.0);
582	greg	1.4	ax = ABS(v1[0]) > ABS(v1[1]) ? 0 : 1;
583			ax = ABS(v1[ax]) > ABS(v1[2]) ? ax : 2;
584	greg	1.3	/* assign equation matrix */
585			eqnmat[0][0] = p0->p[u]*p0->p[v];
586			eqnmat[0][1] = p0->p[u];
587			eqnmat[0][2] = p0->p[v];
588			eqnmat[0][3] = 1.0;
589			eqnmat[1][0] = p1->p[u]*p1->p[v];
590			eqnmat[1][1] = p1->p[u];
591			eqnmat[1][2] = p1->p[v];
592			eqnmat[1][3] = 1.0;
593			eqnmat[2][0] = p2->p[u]*p2->p[v];
594			eqnmat[2][1] = p2->p[u];
595			eqnmat[2][2] = p2->p[v];
596			eqnmat[2][3] = 1.0;
597			eqnmat[3][0] = p3->p[u]*p3->p[v];
598			eqnmat[3][1] = p3->p[u];
599			eqnmat[3][2] = p3->p[v];
600			eqnmat[3][3] = 1.0;
601			/* invert matrix (solve system) */
602	greg	2.5	if (!invmat4(eqnmat, eqnmat))
603	greg	1.3	return(-1); /* no solution */
604			/* compute result matrix */
605			for (j = 0; j < 4; j++)
606			for (i = 0; i < 3; i++)
607	greg	1.4	resmat[j][i] = eqnmat[j][0]*p0->n[i] +
608			eqnmat[j][1]*p1->n[i] +
609			eqnmat[j][2]*p2->n[i] +
610			eqnmat[j][3]*p3->n[i];
611	greg	1.3	return(ax);
612
613			#undef u
614			#undef v
615	greg	1.1	}
616
617
618			double
619	greg	2.12	l_hermite(char *nm)
620	greg	1.1	{
621			double t;
622
623			t = argument(5);
624			return( argument(1)((2.0t-3.0)tt+1.0) +
625			argument(2)(-2.0t+3.0)tt +
626			argument(3)((t-2.0)t+1.0)*t +
627			argument(4)(t-1.0)t*t );
628	greg	1.6	}
629
630
631			double
632	greg	2.12	l_bezier(char *nm)
633	greg	1.6	{
634			double t;
635
636			t = argument(5);
637			return( argument(1) * (1.+t(-3.+t(3.-t))) +
638			argument(2) * 3.t(1.+t*(-2.+t)) +
639			argument(3) * 3.tt*(1.-t) +
640			argument(4) * ttt );
641	greg	1.7	}
642
643
644			double
645	greg	2.12	l_bspline(char *nm)
646	greg	1.7	{
647			double t;
648
649			t = argument(5);
650			return( argument(1) * (1./6.+t(-1./2.+t(1./2.-1./6.*t))) +
651			argument(2) * (2./3.+tt(-1.+1./2.*t)) +
652			argument(3) * (1./6.+t(1./2.+t(1./2.-1./2.*t))) +
653			argument(4) * (1./6.tt*t) );
654	greg	1.1	}