src/gen/gensurf.c

#ifndef lint
static const char RCSid[] = "$Id: gensurf.c,v 2.26 2019/12/07 02:21:42 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? */

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 */
        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(argc, argv)
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
                        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);
        eclock = 0;
                                                /* 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);
                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
)
{
        for ( ; n-- >= 0; rp++) {
                if (!rp->valid)
                        continue;
                fputs("v ", stdout);
                pvect(rp->p);
                if (smooth && !ZEROVECT(rp->n)) {
                        printf("\tvn %.9g %.9g %.9g\n",
                                        rp->n[0], rp->n[1], rp->n[2]);
                        rp->nvalid = ++nnorms;
                } else
                        rp->nvalid = 0;
                printf("\tvt %.9g %.9g\n", rp->uv[0], rp->uv[1]);
                rp->valid = ++nverts;
        }
}


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