1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ LBL"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
4 |
– |
|
5 |
– |
/* Copyright (c) 1989 Regents of the University of California */ |
6 |
– |
|
4 |
|
/* |
5 |
|
* gensurf.c - program to generate functional surfaces |
6 |
|
* |
11 |
|
* rule applied to (s,t). |
12 |
|
* |
13 |
|
* 4/3/87 |
14 |
+ |
* |
15 |
+ |
* 4/16/02 Added conditional vertex output |
16 |
|
*/ |
17 |
|
|
18 |
|
#include "standard.h" |
19 |
|
|
20 |
< |
char XNAME[] = "X`SYS`"; /* x function name */ |
21 |
< |
char YNAME[] = "Y`SYS`"; /* y function name */ |
22 |
< |
char ZNAME[] = "Z`SYS`"; /* z function name */ |
20 |
> |
#include "paths.h" |
21 |
> |
#include "resolu.h" |
22 |
> |
#include "rterror.h" |
23 |
> |
#include "calcomp.h" |
24 |
|
|
25 |
+ |
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 |
+ |
|
31 |
|
#define ABS(x) ((x)>=0 ? (x) : -(x)) |
32 |
|
|
33 |
+ |
#define ZEROVECT(v) (DOT(v,v) <= FTINY*FTINY) |
34 |
+ |
|
35 |
|
#define pvect(p) printf(vformat, (p)[0], (p)[1], (p)[2]) |
36 |
|
|
37 |
|
char vformat[] = "%15.9g %15.9g %15.9g\n"; |
39 |
|
char texname[] = "Phong"; |
40 |
|
|
41 |
|
int smooth = 0; /* apply smoothing? */ |
42 |
+ |
int objout = 0; /* output .OBJ format? */ |
43 |
|
|
44 |
|
char *modname, *surfname; |
45 |
|
|
50 |
|
struct { |
51 |
|
int flags; /* data type */ |
52 |
|
short m, n; /* number of s and t values */ |
53 |
< |
FLOAT *data; /* the data itself, s major sort */ |
53 |
> |
RREAL *data; /* the data itself, s major sort */ |
54 |
|
} datarec; /* our recorded data */ |
55 |
|
|
56 |
+ |
/* XXX this is redundant with rt/noise3.c, should go to a library */ |
57 |
|
double l_hermite(), l_bezier(), l_bspline(), l_dataval(); |
48 |
– |
extern double funvalue(), argument(); |
58 |
|
|
59 |
|
typedef struct { |
60 |
+ |
int valid; /* point is valid (vertex number) */ |
61 |
|
FVECT p; /* vertex position */ |
62 |
|
FVECT n; /* average normal */ |
63 |
+ |
RREAL uv[2]; /* (u,v) position */ |
64 |
|
} POINT; |
65 |
|
|
66 |
|
|
67 |
+ |
void loaddata(char *file, int m, int n, int pointsize); |
68 |
+ |
double l_dataval(char *nam); |
69 |
+ |
void putobjrow(POINT *rp, int n); |
70 |
+ |
void putsquare(POINT *p0, POINT *p1, POINT *p2, POINT *p3); |
71 |
+ |
void comprow(double s, POINT *row, int siz); |
72 |
+ |
void compnorms(POINT *r0, POINT *r1, POINT *r2, int siz); |
73 |
+ |
int norminterp(FVECT resmat[4], POINT *p0, POINT *p1, POINT *p2, POINT *p3); |
74 |
+ |
|
75 |
+ |
|
76 |
+ |
int |
77 |
|
main(argc, argv) |
78 |
|
int argc; |
79 |
|
char *argv[]; |
80 |
|
{ |
60 |
– |
extern long eclock; |
81 |
|
POINT *row0, *row1, *row2, *rp; |
82 |
|
int i, j, m, n; |
83 |
|
char stmp[256]; |
97 |
|
fcompile(argv[++i]); |
98 |
|
else if (!strcmp(argv[i], "-s")) |
99 |
|
smooth++; |
100 |
+ |
else if (!strcmp(argv[i], "-o")) |
101 |
+ |
objout++; |
102 |
|
else |
103 |
|
goto userror; |
104 |
|
|
138 |
|
} |
139 |
|
row0++; row1++; row2++; |
140 |
|
/* print header */ |
141 |
< |
printhead(argc, argv); |
141 |
> |
fputs("# ", stdout); |
142 |
> |
printargs(argc, argv, stdout); |
143 |
|
eclock = 0; |
144 |
|
/* initialize */ |
145 |
|
comprow(-1.0/m, row0, n); |
146 |
|
comprow(0.0, row1, n); |
147 |
|
comprow(1.0/m, row2, n); |
148 |
|
compnorms(row0, row1, row2, n); |
149 |
+ |
if (objout) { |
150 |
+ |
printf("\nusemtl %s\n\n", modname); |
151 |
+ |
putobjrow(row1, n); |
152 |
+ |
} |
153 |
|
/* for each row */ |
154 |
|
for (i = 0; i < m; i++) { |
155 |
|
/* compute next row */ |
159 |
|
row2 = rp; |
160 |
|
comprow((double)(i+2)/m, row2, n); |
161 |
|
compnorms(row0, row1, row2, n); |
162 |
+ |
if (objout) |
163 |
+ |
putobjrow(row1, n); |
164 |
|
|
165 |
|
for (j = 0; j < n; j++) { |
166 |
+ |
int orient = (j & 1); |
167 |
|
/* put polygons */ |
168 |
< |
if ((i+j) & 1) |
168 |
> |
if (!(row0[j].valid && row1[j+1].valid)) |
169 |
> |
orient = 1; |
170 |
> |
else if (!(row1[j].valid && row0[j+1].valid)) |
171 |
> |
orient = 0; |
172 |
> |
if (orient) |
173 |
|
putsquare(&row0[j], &row1[j], |
174 |
|
&row0[j+1], &row1[j+1]); |
175 |
|
else |
178 |
|
} |
179 |
|
} |
180 |
|
|
181 |
< |
quit(0); |
181 |
> |
return 0; |
182 |
|
|
183 |
|
userror: |
184 |
|
fprintf(stderr, "Usage: %s material name ", argv[0]); |
185 |
|
fprintf(stderr, "x(s,t) y(s,t) z(s,t) m n [-s][-e expr][-f file]\n"); |
186 |
< |
quit(1); |
186 |
> |
return 1; |
187 |
|
} |
188 |
|
|
189 |
|
|
190 |
< |
loaddata(file, m, n, pointsize) /* load point data from file */ |
191 |
< |
char *file; |
192 |
< |
int m, n; |
193 |
< |
int pointsize; |
190 |
> |
void |
191 |
> |
loaddata( /* load point data from file */ |
192 |
> |
char *file, |
193 |
> |
int m, |
194 |
> |
int n, |
195 |
> |
int pointsize |
196 |
> |
) |
197 |
|
{ |
161 |
– |
extern char *fgetword(); |
198 |
|
FILE *fp; |
199 |
|
char word[64]; |
200 |
|
register int size; |
201 |
< |
register FLOAT *dp; |
201 |
> |
register RREAL *dp; |
202 |
|
|
203 |
|
datarec.flags = HASBORDER; /* assume border values */ |
204 |
|
datarec.m = m+1; |
206 |
|
size = datarec.m*datarec.n*pointsize; |
207 |
|
if (pointsize == 3) |
208 |
|
datarec.flags |= TRIPLETS; |
209 |
< |
dp = (FLOAT *)malloc(size*sizeof(FLOAT)); |
209 |
> |
dp = (RREAL *)malloc(size*sizeof(RREAL)); |
210 |
|
if ((datarec.data = dp) == NULL) { |
211 |
|
fputs("Out of memory\n", stderr); |
212 |
|
exit(1); |
229 |
|
size--; |
230 |
|
} |
231 |
|
if (size == (m+n+1)*pointsize) { /* no border after all */ |
232 |
< |
dp = (FLOAT *)realloc((char *)datarec.data, |
233 |
< |
m*n*pointsize*sizeof(FLOAT)); |
232 |
> |
dp = (RREAL *)realloc((void *)datarec.data, |
233 |
> |
m*n*pointsize*sizeof(RREAL)); |
234 |
|
if (dp != NULL) |
235 |
|
datarec.data = dp; |
236 |
|
datarec.flags &= ~HASBORDER; |
249 |
|
|
250 |
|
|
251 |
|
double |
252 |
< |
l_dataval(nam) /* return recorded data value */ |
253 |
< |
char *nam; |
252 |
> |
l_dataval( /* return recorded data value */ |
253 |
> |
char *nam |
254 |
> |
) |
255 |
|
{ |
256 |
|
double u, v; |
257 |
|
register int i, j; |
258 |
< |
register FLOAT *dp; |
258 |
> |
register RREAL *dp; |
259 |
|
double d00, d01, d10, d11; |
260 |
|
/* compute coordinates */ |
261 |
|
u = argument(1); v = argument(2); |
291 |
|
} |
292 |
|
|
293 |
|
|
294 |
< |
putsquare(p0, p1, p2, p3) /* put out a square */ |
295 |
< |
POINT *p0, *p1, *p2, *p3; |
294 |
> |
void |
295 |
> |
putobjrow( /* output vertex row to .OBJ */ |
296 |
> |
register POINT *rp, |
297 |
> |
int n |
298 |
> |
) |
299 |
|
{ |
300 |
+ |
static int nverts = 0; |
301 |
+ |
|
302 |
+ |
for ( ; n-- >= 0; rp++) { |
303 |
+ |
if (!rp->valid) |
304 |
+ |
continue; |
305 |
+ |
fputs("v ", stdout); |
306 |
+ |
pvect(rp->p); |
307 |
+ |
if (smooth && !ZEROVECT(rp->n)) |
308 |
+ |
printf("\tvn %.9g %.9g %.9g\n", |
309 |
+ |
rp->n[0], rp->n[1], rp->n[2]); |
310 |
+ |
printf("\tvt %.9g %.9g\n", rp->uv[0], rp->uv[1]); |
311 |
+ |
rp->valid = ++nverts; |
312 |
+ |
} |
313 |
+ |
} |
314 |
+ |
|
315 |
+ |
|
316 |
+ |
void |
317 |
+ |
putsquare( /* put out a square */ |
318 |
+ |
POINT *p0, |
319 |
+ |
POINT *p1, |
320 |
+ |
POINT *p2, |
321 |
+ |
POINT *p3 |
322 |
+ |
) |
323 |
+ |
{ |
324 |
|
static int nout = 0; |
325 |
|
FVECT norm[4]; |
326 |
|
int axis; |
327 |
|
FVECT v1, v2, vc1, vc2; |
328 |
|
int ok1, ok2; |
329 |
|
/* compute exact normals */ |
330 |
< |
fvsum(v1, p1->p, p0->p, -1.0); |
331 |
< |
fvsum(v2, p2->p, p0->p, -1.0); |
332 |
< |
fcross(vc1, v1, v2); |
333 |
< |
ok1 = normalize(vc1) != 0.0; |
334 |
< |
fvsum(v1, p2->p, p3->p, -1.0); |
335 |
< |
fvsum(v2, p1->p, p3->p, -1.0); |
336 |
< |
fcross(vc2, v1, v2); |
337 |
< |
ok2 = normalize(vc2) != 0.0; |
330 |
> |
ok1 = (p0->valid && p1->valid && p2->valid); |
331 |
> |
if (ok1) { |
332 |
> |
VSUB(v1, p1->p, p0->p); |
333 |
> |
VSUB(v2, p2->p, p0->p); |
334 |
> |
fcross(vc1, v1, v2); |
335 |
> |
ok1 = (normalize(vc1) != 0.0); |
336 |
> |
} |
337 |
> |
ok2 = (p1->valid && p2->valid && p3->valid); |
338 |
> |
if (ok2) { |
339 |
> |
VSUB(v1, p2->p, p3->p); |
340 |
> |
VSUB(v2, p1->p, p3->p); |
341 |
> |
fcross(vc2, v1, v2); |
342 |
> |
ok2 = (normalize(vc2) != 0.0); |
343 |
> |
} |
344 |
|
if (!(ok1 | ok2)) |
345 |
|
return; |
346 |
+ |
if (objout) { /* output .OBJ faces */ |
347 |
+ |
int p0n=0, p1n=0, p2n=0, p3n=0; |
348 |
+ |
if (smooth) { |
349 |
+ |
if (!ZEROVECT(p0->n)) |
350 |
+ |
p0n = p0->valid; |
351 |
+ |
if (!ZEROVECT(p1->n)) |
352 |
+ |
p1n = p1->valid; |
353 |
+ |
if (!ZEROVECT(p2->n)) |
354 |
+ |
p2n = p2->valid; |
355 |
+ |
if (!ZEROVECT(p3->n)) |
356 |
+ |
p3n = p3->valid; |
357 |
+ |
} |
358 |
+ |
if (ok1 & ok2 && fdot(vc1,vc2) >= 1.0-FTINY*FTINY) { |
359 |
+ |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d %d/%d/%d\n", |
360 |
+ |
p0->valid, p0->valid, p0n, |
361 |
+ |
p1->valid, p1->valid, p1n, |
362 |
+ |
p3->valid, p3->valid, p3n, |
363 |
+ |
p2->valid, p2->valid, p2n); |
364 |
+ |
return; |
365 |
+ |
} |
366 |
+ |
if (ok1) |
367 |
+ |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d\n", |
368 |
+ |
p0->valid, p0->valid, p0n, |
369 |
+ |
p1->valid, p1->valid, p1n, |
370 |
+ |
p2->valid, p2->valid, p2n); |
371 |
+ |
if (ok2) |
372 |
+ |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d\n", |
373 |
+ |
p2->valid, p2->valid, p2n, |
374 |
+ |
p1->valid, p1->valid, p1n, |
375 |
+ |
p3->valid, p3->valid, p3n); |
376 |
+ |
return; |
377 |
+ |
} |
378 |
|
/* compute normal interpolation */ |
379 |
|
axis = norminterp(norm, p0, p1, p2, p3); |
380 |
|
|
443 |
|
} |
444 |
|
|
445 |
|
|
446 |
< |
comprow(s, row, siz) /* compute row of values */ |
447 |
< |
double s; |
448 |
< |
register POINT *row; |
449 |
< |
int siz; |
446 |
> |
void |
447 |
> |
comprow( /* compute row of values */ |
448 |
> |
double s, |
449 |
> |
register POINT *row, |
450 |
> |
int siz |
451 |
> |
) |
452 |
|
{ |
453 |
|
double st[2]; |
454 |
|
int end; |
455 |
+ |
int checkvalid; |
456 |
|
register int i; |
457 |
|
|
458 |
|
if (smooth) { |
465 |
|
end = siz; |
466 |
|
} |
467 |
|
st[0] = s; |
468 |
+ |
checkvalid = (fundefined(VNAME) == 2); |
469 |
|
while (i <= end) { |
470 |
|
st[1] = (double)i/siz; |
471 |
< |
row[i].p[0] = funvalue(XNAME, 2, st); |
472 |
< |
row[i].p[1] = funvalue(YNAME, 2, st); |
473 |
< |
row[i].p[2] = funvalue(ZNAME, 2, st); |
471 |
> |
if (checkvalid && funvalue(VNAME, 2, st) <= 0.0) { |
472 |
> |
row[i].valid = 0; |
473 |
> |
row[i].p[0] = row[i].p[1] = row[i].p[2] = 0.0; |
474 |
> |
row[i].uv[0] = row[i].uv[1] = 0.0; |
475 |
> |
} else { |
476 |
> |
row[i].valid = 1; |
477 |
> |
row[i].p[0] = funvalue(XNAME, 2, st); |
478 |
> |
row[i].p[1] = funvalue(YNAME, 2, st); |
479 |
> |
row[i].p[2] = funvalue(ZNAME, 2, st); |
480 |
> |
row[i].uv[0] = st[0]; |
481 |
> |
row[i].uv[1] = st[1]; |
482 |
> |
} |
483 |
|
i++; |
484 |
|
} |
485 |
|
} |
486 |
|
|
487 |
|
|
488 |
< |
compnorms(r0, r1, r2, siz) /* compute row of averaged normals */ |
489 |
< |
register POINT *r0, *r1, *r2; |
490 |
< |
int siz; |
488 |
> |
void |
489 |
> |
compnorms( /* compute row of averaged normals */ |
490 |
> |
register POINT *r0, |
491 |
> |
register POINT *r1, |
492 |
> |
register POINT *r2, |
493 |
> |
int siz |
494 |
> |
) |
495 |
|
{ |
496 |
|
FVECT v1, v2; |
378 |
– |
register int i; |
497 |
|
|
498 |
|
if (!smooth) /* not needed if no smoothing */ |
499 |
|
return; |
500 |
< |
/* compute middle points */ |
500 |
> |
/* compute row 1 normals */ |
501 |
|
while (siz-- >= 0) { |
502 |
< |
fvsum(v1, r2[0].p, r0[0].p, -1.0); |
503 |
< |
fvsum(v2, r1[1].p, r1[-1].p, -1.0); |
502 |
> |
if (!r1[0].valid) |
503 |
> |
continue; |
504 |
> |
if (!r0[0].valid) { |
505 |
> |
if (!r2[0].valid) { |
506 |
> |
r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0; |
507 |
> |
continue; |
508 |
> |
} |
509 |
> |
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
510 |
> |
} else if (!r2[0].valid) |
511 |
> |
fvsum(v1, r1[0].p, r0[0].p, -1.0); |
512 |
> |
else |
513 |
> |
fvsum(v1, r2[0].p, r0[0].p, -1.0); |
514 |
> |
if (!r1[-1].valid) { |
515 |
> |
if (!r1[1].valid) { |
516 |
> |
r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0; |
517 |
> |
continue; |
518 |
> |
} |
519 |
> |
fvsum(v2, r1[1].p, r1[0].p, -1.0); |
520 |
> |
} else if (!r1[1].valid) |
521 |
> |
fvsum(v2, r1[0].p, r1[-1].p, -1.0); |
522 |
> |
else |
523 |
> |
fvsum(v2, r1[1].p, r1[-1].p, -1.0); |
524 |
|
fcross(r1[0].n, v1, v2); |
525 |
|
normalize(r1[0].n); |
526 |
|
r0++; r1++; r2++; |
529 |
|
|
530 |
|
|
531 |
|
int |
532 |
< |
norminterp(resmat, p0, p1, p2, p3) /* compute normal interpolation */ |
533 |
< |
register FVECT resmat[4]; |
534 |
< |
POINT *p0, *p1, *p2, *p3; |
532 |
> |
norminterp( /* compute normal interpolation */ |
533 |
> |
register FVECT resmat[4], |
534 |
> |
POINT *p0, |
535 |
> |
POINT *p1, |
536 |
> |
POINT *p2, |
537 |
> |
POINT *p3 |
538 |
> |
) |
539 |
|
{ |
540 |
|
#define u ((ax+1)%3) |
541 |
|
#define v ((ax+2)%3) |
572 |
|
eqnmat[3][2] = p3->p[v]; |
573 |
|
eqnmat[3][3] = 1.0; |
574 |
|
/* invert matrix (solve system) */ |
575 |
< |
if (!invmat(eqnmat, eqnmat)) |
575 |
> |
if (!invmat4(eqnmat, eqnmat)) |
576 |
|
return(-1); /* no solution */ |
577 |
|
/* compute result matrix */ |
578 |
|
for (j = 0; j < 4; j++) |
588 |
|
} |
589 |
|
|
590 |
|
|
449 |
– |
/* |
450 |
– |
* invmat - computes the inverse of mat into inverse. Returns 1 |
451 |
– |
* if there exists an inverse, 0 otherwise. It uses Gaussian Elimination |
452 |
– |
* method. |
453 |
– |
*/ |
454 |
– |
|
455 |
– |
invmat(inverse,mat) |
456 |
– |
MAT4 inverse, mat; |
457 |
– |
{ |
458 |
– |
#define SWAP(a,b,t) (t=a,a=b,b=t) |
459 |
– |
|
460 |
– |
MAT4 m4tmp; |
461 |
– |
register int i,j,k; |
462 |
– |
register double temp; |
463 |
– |
|
464 |
– |
copymat4(m4tmp, mat); |
465 |
– |
/* set inverse to identity */ |
466 |
– |
for (i = 0; i < 4; i++) |
467 |
– |
for (j = 0; j < 4; j++) |
468 |
– |
inverse[i][j] = i==j ? 1.0 : 0.0; |
469 |
– |
|
470 |
– |
for(i = 0; i < 4; i++) { |
471 |
– |
/* Look for row with largest pivot and swap rows */ |
472 |
– |
temp = FTINY; j = -1; |
473 |
– |
for(k = i; k < 4; k++) |
474 |
– |
if(ABS(m4tmp[k][i]) > temp) { |
475 |
– |
temp = ABS(m4tmp[k][i]); |
476 |
– |
j = k; |
477 |
– |
} |
478 |
– |
if(j == -1) /* No replacing row -> no inverse */ |
479 |
– |
return(0); |
480 |
– |
if (j != i) |
481 |
– |
for(k = 0; k < 4; k++) { |
482 |
– |
SWAP(m4tmp[i][k],m4tmp[j][k],temp); |
483 |
– |
SWAP(inverse[i][k],inverse[j][k],temp); |
484 |
– |
} |
485 |
– |
|
486 |
– |
temp = m4tmp[i][i]; |
487 |
– |
for(k = 0; k < 4; k++) { |
488 |
– |
m4tmp[i][k] /= temp; |
489 |
– |
inverse[i][k] /= temp; |
490 |
– |
} |
491 |
– |
for(j = 0; j < 4; j++) { |
492 |
– |
if(j != i) { |
493 |
– |
temp = m4tmp[j][i]; |
494 |
– |
for(k = 0; k < 4; k++) { |
495 |
– |
m4tmp[j][k] -= m4tmp[i][k]*temp; |
496 |
– |
inverse[j][k] -= inverse[i][k]*temp; |
497 |
– |
} |
498 |
– |
} |
499 |
– |
} |
500 |
– |
} |
501 |
– |
return(1); |
502 |
– |
|
503 |
– |
#undef SWAP |
504 |
– |
} |
505 |
– |
|
506 |
– |
|
507 |
– |
eputs(msg) |
508 |
– |
char *msg; |
509 |
– |
{ |
510 |
– |
fputs(msg, stderr); |
511 |
– |
} |
512 |
– |
|
513 |
– |
|
514 |
– |
wputs(msg) |
515 |
– |
char *msg; |
516 |
– |
{ |
517 |
– |
eputs(msg); |
518 |
– |
} |
519 |
– |
|
520 |
– |
|
521 |
– |
quit(code) |
522 |
– |
{ |
523 |
– |
exit(code); |
524 |
– |
} |
525 |
– |
|
526 |
– |
|
527 |
– |
printhead(ac, av) /* print command header */ |
528 |
– |
register int ac; |
529 |
– |
register char **av; |
530 |
– |
{ |
531 |
– |
putchar('#'); |
532 |
– |
while (ac--) { |
533 |
– |
putchar(' '); |
534 |
– |
fputs(*av++, stdout); |
535 |
– |
} |
536 |
– |
putchar('\n'); |
537 |
– |
} |
538 |
– |
|
539 |
– |
|
591 |
|
double |
592 |
< |
l_hermite() |
592 |
> |
l_hermite(char *nm) |
593 |
|
{ |
594 |
|
double t; |
595 |
|
|
602 |
|
|
603 |
|
|
604 |
|
double |
605 |
< |
l_bezier() |
605 |
> |
l_bezier(char *nm) |
606 |
|
{ |
607 |
|
double t; |
608 |
|
|
615 |
|
|
616 |
|
|
617 |
|
double |
618 |
< |
l_bspline() |
618 |
> |
l_bspline(char *nm) |
619 |
|
{ |
620 |
|
double t; |
621 |
|
|