40 |
|
|
41 |
|
int smooth = 0; /* apply smoothing? */ |
42 |
|
int objout = 0; /* output .OBJ format? */ |
43 |
+ |
int rev = 0; /* invert normal directions? */ |
44 |
|
|
45 |
|
char *modname, *surfname; |
46 |
|
|
55 |
|
} datarec; /* our recorded data */ |
56 |
|
|
57 |
|
/* XXX this is redundant with rt/noise3.c, should go to a library */ |
58 |
< |
double l_hermite(), l_bezier(), l_bspline(), l_dataval(); |
58 |
> |
double l_hermite(char *), l_bezier(char *), |
59 |
> |
l_bspline(char *), l_dataval(char *); |
60 |
|
|
61 |
|
typedef struct { |
62 |
|
int valid; /* point is valid (vertex number) */ |
63 |
< |
int nvalid; /* normal is valid */ |
63 |
> |
int nvalid; /* normal is valid (normal number) */ |
64 |
|
FVECT p; /* vertex position */ |
65 |
|
FVECT n; /* average normal */ |
66 |
|
RREAL uv[2]; /* (u,v) position */ |
67 |
|
} POINT; |
68 |
|
|
69 |
+ |
int nverts = 0; /* vertex output count */ |
70 |
+ |
int nnorms = 0; /* normal output count */ |
71 |
|
|
72 |
|
void loaddata(char *file, int m, int n, int pointsize); |
73 |
|
double l_dataval(char *nam); |
74 |
|
void putobjrow(POINT *rp, int n); |
75 |
+ |
void putobjvert(POINT *p); |
76 |
|
void putsquare(POINT *p0, POINT *p1, POINT *p2, POINT *p3); |
77 |
|
void comprow(double s, POINT *row, int siz); |
78 |
|
void compnorms(POINT *r0, POINT *r1, POINT *r2, int siz); |
80 |
|
|
81 |
|
|
82 |
|
int |
83 |
< |
main(argc, argv) |
79 |
< |
int argc; |
80 |
< |
char *argv[]; |
83 |
> |
main(int argc, char *argv[]) |
84 |
|
{ |
85 |
|
POINT *row0, *row1, *row2, *rp; |
86 |
|
int i, j, m, n; |
87 |
|
char stmp[256]; |
88 |
|
|
89 |
+ |
esupport |= E_VARIABLE|E_FUNCTION|E_RCONST; |
90 |
+ |
esupport &= ~(E_OUTCHAN|E_INCHAN); |
91 |
|
varset("PI", ':', PI); |
92 |
|
funset("hermite", 5, ':', l_hermite); |
93 |
|
funset("bezier", 5, ':', l_bezier); |
99 |
|
for (i = 8; i < argc; i++) |
100 |
|
if (!strcmp(argv[i], "-e")) |
101 |
|
scompile(argv[++i], NULL, 0); |
102 |
< |
else if (!strcmp(argv[i], "-f")) |
103 |
< |
fcompile(argv[++i]); |
104 |
< |
else if (!strcmp(argv[i], "-s")) |
102 |
> |
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 |
|
smooth++; |
112 |
|
else if (!strcmp(argv[i], "-o")) |
113 |
|
objout++; |
114 |
+ |
else if (!strcmp(argv[i], "-i")) |
115 |
+ |
rev = 1; |
116 |
|
else |
117 |
|
goto userror; |
118 |
|
|
119 |
|
modname = argv[1]; |
120 |
|
surfname = argv[2]; |
121 |
< |
m = atoi(argv[6]); |
122 |
< |
n = atoi(argv[7]); |
121 |
> |
m = eval(argv[6]) + .5; |
122 |
> |
n = eval(argv[7]) + .5; |
123 |
|
if (m <= 0 || n <= 0) |
124 |
|
goto userror; |
125 |
|
if (!strcmp(argv[5], "-") || access(argv[5], 4) == 0) { /* file? */ |
154 |
|
/* print header */ |
155 |
|
fputs("# ", stdout); |
156 |
|
printargs(argc, argv, stdout); |
157 |
< |
eclock = 0; |
157 |
> |
doptimize(1); |
158 |
> |
eclock++; |
159 |
|
/* initialize */ |
160 |
|
comprow(-1.0/m, row0, n); |
161 |
|
comprow(0.0, row1, n); |
163 |
|
compnorms(row0, row1, row2, n); |
164 |
|
if (objout) { |
165 |
|
printf("\nusemtl %s\n\n", modname); |
166 |
+ |
printf("o %s\n\n", surfname); |
167 |
|
putobjrow(row1, n); |
168 |
|
} |
169 |
|
/* for each row */ |
213 |
|
{ |
214 |
|
FILE *fp; |
215 |
|
char word[64]; |
216 |
< |
register int size; |
217 |
< |
register RREAL *dp; |
216 |
> |
int size; |
217 |
> |
RREAL *dp; |
218 |
|
|
219 |
|
datarec.flags = HASBORDER; /* assume border values */ |
220 |
|
datarec.m = m+1; |
270 |
|
) |
271 |
|
{ |
272 |
|
double u, v; |
273 |
< |
register int i, j; |
274 |
< |
register RREAL *dp; |
273 |
> |
int i, j; |
274 |
> |
RREAL *dp; |
275 |
|
double d00, d01, d10, d11; |
276 |
|
/* compute coordinates */ |
277 |
|
u = argument(1); v = argument(2); |
309 |
|
|
310 |
|
void |
311 |
|
putobjrow( /* output vertex row to .OBJ */ |
312 |
< |
register POINT *rp, |
312 |
> |
POINT *rp, |
313 |
|
int n |
314 |
|
) |
315 |
|
{ |
316 |
< |
static int nverts = 0; |
302 |
< |
static int nnorms = 0; |
316 |
> |
static FVECT prevNorm; |
317 |
|
|
318 |
|
for ( ; n-- >= 0; rp++) { |
319 |
|
if (!rp->valid) |
320 |
|
continue; |
321 |
|
fputs("v ", stdout); |
322 |
|
pvect(rp->p); |
323 |
< |
if (smooth && !ZEROVECT(rp->n)) { |
323 |
> |
rp->valid = ++nverts; |
324 |
> |
printf("\tvt %.9g %.9g\n", rp->uv[0], rp->uv[1]); |
325 |
> |
if (!smooth || ZEROVECT(rp->n)) |
326 |
> |
rp->nvalid = 0; |
327 |
> |
else if (VABSEQ(rp->n, prevNorm)) |
328 |
> |
rp->nvalid = nnorms; |
329 |
> |
else { |
330 |
|
printf("\tvn %.9g %.9g %.9g\n", |
331 |
|
rp->n[0], rp->n[1], rp->n[2]); |
332 |
|
rp->nvalid = ++nnorms; |
333 |
< |
} else |
334 |
< |
rp->nvalid = 0; |
315 |
< |
printf("\tvt %.9g %.9g\n", rp->uv[0], rp->uv[1]); |
316 |
< |
rp->valid = ++nverts; |
333 |
> |
VCOPY(prevNorm, rp->n); |
334 |
> |
} |
335 |
|
} |
336 |
|
} |
337 |
|
|
338 |
|
|
339 |
|
void |
340 |
+ |
putobjvert( /* put out OBJ vertex index triplet */ |
341 |
+ |
POINT *p |
342 |
+ |
) |
343 |
+ |
{ |
344 |
+ |
int pti = p->valid ? p->valid-nverts-1 : 0; |
345 |
+ |
int ni = p->nvalid ? p->nvalid-nnorms-1 : 0; |
346 |
+ |
|
347 |
+ |
printf(" %d/%d/%d", pti, pti, ni); |
348 |
+ |
} |
349 |
+ |
|
350 |
+ |
|
351 |
+ |
void |
352 |
|
putsquare( /* put out a square */ |
353 |
|
POINT *p0, |
354 |
|
POINT *p1, |
361 |
|
int axis; |
362 |
|
FVECT v1, v2, vc1, vc2; |
363 |
|
int ok1, ok2; |
364 |
+ |
|
365 |
+ |
if (rev) { /* reverse normals? */ |
366 |
+ |
POINT *pt = p1; p1 = p2; p2 = pt; |
367 |
+ |
} |
368 |
|
/* compute exact normals */ |
369 |
|
ok1 = (p0->valid && p1->valid && p2->valid); |
370 |
|
if (ok1) { |
384 |
|
return; |
385 |
|
if (objout) { /* output .OBJ faces */ |
386 |
|
if (ok1 & ok2 && fdot(vc1,vc2) >= 1.0-FTINY*FTINY) { |
387 |
< |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d %d/%d/%d\n", |
388 |
< |
p0->valid, p0->valid, p0->nvalid, |
389 |
< |
p1->valid, p1->valid, p1->nvalid, |
390 |
< |
p3->valid, p3->valid, p3->nvalid, |
357 |
< |
p2->valid, p2->valid, p2->nvalid); |
387 |
> |
putc('f', stdout); |
388 |
> |
putobjvert(p0); putobjvert(p1); |
389 |
> |
putobjvert(p3); putobjvert(p2); |
390 |
> |
putc('\n', stdout); |
391 |
|
return; |
392 |
|
} |
393 |
< |
if (ok1) |
394 |
< |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d\n", |
395 |
< |
p0->valid, p0->valid, p0->nvalid, |
396 |
< |
p1->valid, p1->valid, p1->nvalid, |
397 |
< |
p2->valid, p2->valid, p2->nvalid); |
398 |
< |
if (ok2) |
399 |
< |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d\n", |
400 |
< |
p2->valid, p2->valid, p2->nvalid, |
401 |
< |
p1->valid, p1->valid, p1->nvalid, |
402 |
< |
p3->valid, p3->valid, p3->nvalid); |
393 |
> |
if (ok1) { |
394 |
> |
putc('f', stdout); |
395 |
> |
putobjvert(p0); putobjvert(p1); putobjvert(p2); |
396 |
> |
putc('\n', stdout); |
397 |
> |
} |
398 |
> |
if (ok2) { |
399 |
> |
putc('f', stdout); |
400 |
> |
putobjvert(p2); putobjvert(p1); putobjvert(p3); |
401 |
> |
putc('\n', stdout); |
402 |
> |
} |
403 |
|
return; |
404 |
|
} |
405 |
|
/* compute normal interpolation */ |
470 |
|
void |
471 |
|
comprow( /* compute row of values */ |
472 |
|
double s, |
473 |
< |
register POINT *row, |
473 |
> |
POINT *row, |
474 |
|
int siz |
475 |
|
) |
476 |
|
{ |
477 |
|
double st[2]; |
478 |
|
int end; |
479 |
|
int checkvalid; |
480 |
< |
register int i; |
480 |
> |
int i; |
481 |
|
|
482 |
|
if (smooth) { |
483 |
|
i = -1; /* compute one past each end */ |
511 |
|
|
512 |
|
void |
513 |
|
compnorms( /* compute row of averaged normals */ |
514 |
< |
register POINT *r0, |
515 |
< |
register POINT *r1, |
516 |
< |
register POINT *r2, |
514 |
> |
POINT *r0, |
515 |
> |
POINT *r1, |
516 |
> |
POINT *r2, |
517 |
|
int siz |
518 |
|
) |
519 |
|
{ |
524 |
|
/* compute row 1 normals */ |
525 |
|
while (siz-- >= 0) { |
526 |
|
if (!r1[0].valid) |
527 |
< |
continue; |
527 |
> |
goto skip; |
528 |
|
if (!r0[0].valid) { |
529 |
|
if (!r2[0].valid) { |
530 |
|
r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0; |
531 |
< |
continue; |
531 |
> |
goto skip; |
532 |
|
} |
533 |
|
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
534 |
|
} else if (!r2[0].valid) |
538 |
|
if (!r1[-1].valid) { |
539 |
|
if (!r1[1].valid) { |
540 |
|
r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0; |
541 |
< |
continue; |
541 |
> |
goto skip; |
542 |
|
} |
543 |
|
fvsum(v2, r1[1].p, r1[0].p, -1.0); |
544 |
|
} else if (!r1[1].valid) |
545 |
|
fvsum(v2, r1[0].p, r1[-1].p, -1.0); |
546 |
|
else |
547 |
|
fvsum(v2, r1[1].p, r1[-1].p, -1.0); |
548 |
< |
fcross(r1[0].n, v1, v2); |
548 |
> |
if (rev) |
549 |
> |
fcross(r1[0].n, v2, v1); |
550 |
> |
else |
551 |
> |
fcross(r1[0].n, v1, v2); |
552 |
|
normalize(r1[0].n); |
553 |
+ |
skip: |
554 |
|
r0++; r1++; r2++; |
555 |
|
} |
556 |
|
} |
558 |
|
|
559 |
|
int |
560 |
|
norminterp( /* compute normal interpolation */ |
561 |
< |
register FVECT resmat[4], |
561 |
> |
FVECT resmat[4], |
562 |
|
POINT *p0, |
563 |
|
POINT *p1, |
564 |
|
POINT *p2, |
568 |
|
#define u ((ax+1)%3) |
569 |
|
#define v ((ax+2)%3) |
570 |
|
|
571 |
< |
register int ax; |
571 |
> |
int ax; |
572 |
|
MAT4 eqnmat; |
573 |
|
FVECT v1; |
574 |
< |
register int i, j; |
574 |
> |
int i, j; |
575 |
|
|
576 |
|
if (!smooth) /* no interpolation if no smoothing */ |
577 |
|
return(-1); |