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 |
> |
char XNAME[] = "X`SYS"; /* x function name */ |
21 |
> |
char YNAME[] = "Y`SYS"; /* y function name */ |
22 |
> |
char ZNAME[] = "Z`SYS"; /* z function name */ |
23 |
|
|
24 |
+ |
char VNAME[] = "valid"; /* valid vertex name */ |
25 |
+ |
|
26 |
|
#define ABS(x) ((x)>=0 ? (x) : -(x)) |
27 |
|
|
28 |
|
#define pvect(p) printf(vformat, (p)[0], (p)[1], (p)[2]) |
32 |
|
char texname[] = "Phong"; |
33 |
|
|
34 |
|
int smooth = 0; /* apply smoothing? */ |
35 |
+ |
int objout = 0; /* output .OBJ format? */ |
36 |
|
|
37 |
|
char *modname, *surfname; |
38 |
|
|
50 |
|
extern double funvalue(), argument(); |
51 |
|
|
52 |
|
typedef struct { |
53 |
+ |
int valid; /* point is valid (vertex number) */ |
54 |
|
FVECT p; /* vertex position */ |
55 |
|
FVECT n; /* average normal */ |
56 |
+ |
FLOAT uv[2]; /* (u,v) position */ |
57 |
|
} POINT; |
58 |
|
|
59 |
|
|
81 |
|
fcompile(argv[++i]); |
82 |
|
else if (!strcmp(argv[i], "-s")) |
83 |
|
smooth++; |
84 |
+ |
else if (!strcmp(argv[i], "-o")) |
85 |
+ |
objout++; |
86 |
|
else |
87 |
|
goto userror; |
88 |
|
|
129 |
|
comprow(0.0, row1, n); |
130 |
|
comprow(1.0/m, row2, n); |
131 |
|
compnorms(row0, row1, row2, n); |
132 |
+ |
if (objout) |
133 |
+ |
putobjrow(row1, n); |
134 |
|
/* for each row */ |
135 |
|
for (i = 0; i < m; i++) { |
136 |
|
/* compute next row */ |
140 |
|
row2 = rp; |
141 |
|
comprow((double)(i+2)/m, row2, n); |
142 |
|
compnorms(row0, row1, row2, n); |
143 |
+ |
if (objout) |
144 |
+ |
putobjrow(row1, n); |
145 |
|
|
146 |
|
for (j = 0; j < n; j++) { |
147 |
+ |
int orient = (j & 1); |
148 |
|
/* put polygons */ |
149 |
< |
if ((i+j) & 1) |
149 |
> |
if (!(row0[j].valid && row1[j+1].valid)) |
150 |
> |
orient = 1; |
151 |
> |
else if (!(row1[j].valid && row0[j+1].valid)) |
152 |
> |
orient = 0; |
153 |
> |
if (orient) |
154 |
|
putsquare(&row0[j], &row1[j], |
155 |
|
&row0[j+1], &row1[j+1]); |
156 |
|
else |
173 |
|
int m, n; |
174 |
|
int pointsize; |
175 |
|
{ |
161 |
– |
extern char *fgetword(); |
176 |
|
FILE *fp; |
177 |
|
char word[64]; |
178 |
|
register int size; |
268 |
|
} |
269 |
|
|
270 |
|
|
271 |
+ |
putobjrow(rp, n) /* output vertex row to .OBJ */ |
272 |
+ |
register POINT *rp; |
273 |
+ |
int n; |
274 |
+ |
{ |
275 |
+ |
static int nverts = 0; |
276 |
+ |
|
277 |
+ |
for ( ; n-- >= 0; rp++) { |
278 |
+ |
if (!rp->valid) |
279 |
+ |
continue; |
280 |
+ |
fputs("v ", stdout); |
281 |
+ |
printf(vformat, rp->p[0], rp->p[1], rp->p[2]); |
282 |
+ |
if (smooth) |
283 |
+ |
printf("\tvn %.9g %.9g %.9g\n", |
284 |
+ |
rp->n[0], rp->n[1], rp->n[2]); |
285 |
+ |
printf("\tvt %.9g %.9g\n", rp->uv[0], rp->uv[1]); |
286 |
+ |
rp->valid = ++nverts; |
287 |
+ |
} |
288 |
+ |
} |
289 |
+ |
|
290 |
+ |
|
291 |
|
putsquare(p0, p1, p2, p3) /* put out a square */ |
292 |
|
POINT *p0, *p1, *p2, *p3; |
293 |
|
{ |
297 |
|
FVECT v1, v2, vc1, vc2; |
298 |
|
int ok1, ok2; |
299 |
|
/* compute exact normals */ |
300 |
< |
fvsum(v1, p1->p, p0->p, -1.0); |
301 |
< |
fvsum(v2, p2->p, p0->p, -1.0); |
302 |
< |
fcross(vc1, v1, v2); |
303 |
< |
ok1 = normalize(vc1) != 0.0; |
304 |
< |
fvsum(v1, p2->p, p3->p, -1.0); |
305 |
< |
fvsum(v2, p1->p, p3->p, -1.0); |
306 |
< |
fcross(vc2, v1, v2); |
307 |
< |
ok2 = normalize(vc2) != 0.0; |
300 |
> |
ok1 = (p0->valid && p1->valid && p2->valid); |
301 |
> |
if (ok1) { |
302 |
> |
fvsum(v1, p1->p, p0->p, -1.0); |
303 |
> |
fvsum(v2, p2->p, p0->p, -1.0); |
304 |
> |
fcross(vc1, v1, v2); |
305 |
> |
ok1 = (normalize(vc1) != 0.0); |
306 |
> |
} |
307 |
> |
ok2 = (p1->valid && p2->valid && p3->valid); |
308 |
> |
if (ok2) { |
309 |
> |
fvsum(v1, p2->p, p3->p, -1.0); |
310 |
> |
fvsum(v2, p1->p, p3->p, -1.0); |
311 |
> |
fcross(vc2, v1, v2); |
312 |
> |
ok2 = (normalize(vc2) != 0.0); |
313 |
> |
} |
314 |
|
if (!(ok1 | ok2)) |
315 |
|
return; |
316 |
+ |
if (objout) { /* output .OBJ faces */ |
317 |
+ |
int p0n=0, p1n=0, p2n=0, p3n=0; |
318 |
+ |
if (smooth) { |
319 |
+ |
p0n = p0->valid; |
320 |
+ |
p1n = p1->valid; |
321 |
+ |
p2n = p2->valid; |
322 |
+ |
p3n = p3->valid; |
323 |
+ |
} |
324 |
+ |
if (ok1 & ok2 && fdot(vc1,vc2) >= 1.0-FTINY*FTINY) { |
325 |
+ |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d %d/%d/%d\n", |
326 |
+ |
p0->valid, p0n, p0->valid, |
327 |
+ |
p1->valid, p1n, p1->valid, |
328 |
+ |
p3->valid, p3n, p3->valid, |
329 |
+ |
p2->valid, p2n, p2->valid); |
330 |
+ |
return; |
331 |
+ |
} |
332 |
+ |
if (ok1) |
333 |
+ |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d\n", |
334 |
+ |
p0->valid, p0n, p0->valid, |
335 |
+ |
p1->valid, p1n, p1->valid, |
336 |
+ |
p2->valid, p2n, p2->valid); |
337 |
+ |
if (ok2) |
338 |
+ |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d\n", |
339 |
+ |
p2->valid, p2n, p2->valid, |
340 |
+ |
p1->valid, p1n, p1->valid, |
341 |
+ |
p3->valid, p3n, p3->valid); |
342 |
+ |
return; |
343 |
+ |
} |
344 |
|
/* compute normal interpolation */ |
345 |
|
axis = norminterp(norm, p0, p1, p2, p3); |
346 |
|
|
416 |
|
{ |
417 |
|
double st[2]; |
418 |
|
int end; |
419 |
+ |
int checkvalid; |
420 |
|
register int i; |
421 |
|
|
422 |
|
if (smooth) { |
429 |
|
end = siz; |
430 |
|
} |
431 |
|
st[0] = s; |
432 |
+ |
checkvalid = (fundefined(VNAME) == 2); |
433 |
|
while (i <= end) { |
434 |
|
st[1] = (double)i/siz; |
435 |
< |
row[i].p[0] = funvalue(XNAME, 2, st); |
436 |
< |
row[i].p[1] = funvalue(YNAME, 2, st); |
437 |
< |
row[i].p[2] = funvalue(ZNAME, 2, st); |
435 |
> |
if (checkvalid && funvalue(VNAME, 2, st) <= 0.0) { |
436 |
> |
row[i].valid = 0; |
437 |
> |
row[i].p[0] = row[i].p[1] = row[i].p[2] = 0.0; |
438 |
> |
row[i].uv[0] = row[i].uv[1] = 0.0; |
439 |
> |
} else { |
440 |
> |
row[i].valid = 1; |
441 |
> |
row[i].p[0] = funvalue(XNAME, 2, st); |
442 |
> |
row[i].p[1] = funvalue(YNAME, 2, st); |
443 |
> |
row[i].p[2] = funvalue(ZNAME, 2, st); |
444 |
> |
row[i].uv[0] = st[0]; |
445 |
> |
row[i].uv[1] = st[1]; |
446 |
> |
} |
447 |
|
i++; |
448 |
|
} |
449 |
|
} |
457 |
|
|
458 |
|
if (!smooth) /* not needed if no smoothing */ |
459 |
|
return; |
460 |
< |
/* compute middle points */ |
460 |
> |
/* compute row 1 normals */ |
461 |
|
while (siz-- >= 0) { |
462 |
< |
fvsum(v1, r2[0].p, r0[0].p, -1.0); |
463 |
< |
fvsum(v2, r1[1].p, r1[-1].p, -1.0); |
462 |
> |
if (!r1[0].valid) |
463 |
> |
continue; |
464 |
> |
if (!r0[0].valid) { |
465 |
> |
if (!r2[0].valid) { |
466 |
> |
r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0; |
467 |
> |
continue; |
468 |
> |
} |
469 |
> |
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
470 |
> |
} else if (!r2[0].valid) |
471 |
> |
fvsum(v1, r1[0].p, r0[0].p, -1.0); |
472 |
> |
else |
473 |
> |
fvsum(v1, r2[0].p, r0[0].p, -1.0); |
474 |
> |
if (!r1[-1].valid) { |
475 |
> |
if (!r1[1].valid) { |
476 |
> |
r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0; |
477 |
> |
continue; |
478 |
> |
} |
479 |
> |
fvsum(v2, r1[1].p, r1[0].p, -1.0); |
480 |
> |
} else if (!r1[1].valid) |
481 |
> |
fvsum(v2, r1[0].p, r1[-1].p, -1.0); |
482 |
> |
else |
483 |
> |
fvsum(v2, r1[1].p, r1[-1].p, -1.0); |
484 |
|
fcross(r1[0].n, v1, v2); |
485 |
|
normalize(r1[0].n); |
486 |
|
r0++; r1++; r2++; |
544 |
|
} |
545 |
|
|
546 |
|
|
547 |
+ |
void |
548 |
|
eputs(msg) |
549 |
|
char *msg; |
550 |
|
{ |
552 |
|
} |
553 |
|
|
554 |
|
|
555 |
+ |
void |
556 |
|
wputs(msg) |
557 |
|
char *msg; |
558 |
|
{ |
560 |
|
} |
561 |
|
|
562 |
|
|
563 |
+ |
void |
564 |
|
quit(code) |
565 |
|
int code; |
566 |
|
{ |