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 |
< |
#define XNAME "X_" /* x function name */ |
21 |
< |
#define YNAME "Y_" /* y function name */ |
22 |
< |
#define ZNAME "Z_" /* 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]) |
35 |
|
|
36 |
|
char *modname, *surfname; |
37 |
|
|
38 |
< |
double funvalue(), l_hermite(), l_bezier(), l_bspline(), argument(); |
38 |
> |
/* recorded data flags */ |
39 |
> |
#define HASBORDER 01 |
40 |
> |
#define TRIPLETS 02 |
41 |
> |
/* a data structure */ |
42 |
> |
struct { |
43 |
> |
int flags; /* data type */ |
44 |
> |
short m, n; /* number of s and t values */ |
45 |
> |
FLOAT *data; /* the data itself, s major sort */ |
46 |
> |
} datarec; /* our recorded data */ |
47 |
|
|
48 |
+ |
double l_hermite(), l_bezier(), l_bspline(), l_dataval(); |
49 |
+ |
extern double funvalue(), argument(); |
50 |
+ |
|
51 |
|
typedef struct { |
52 |
+ |
int valid; /* point is valid */ |
53 |
|
FVECT p; /* vertex position */ |
54 |
|
FVECT n; /* average normal */ |
55 |
|
} POINT; |
59 |
|
int argc; |
60 |
|
char *argv[]; |
61 |
|
{ |
62 |
+ |
extern long eclock; |
63 |
|
POINT *row0, *row1, *row2, *rp; |
64 |
|
int i, j, m, n; |
65 |
|
char stmp[256]; |
66 |
|
|
67 |
< |
varset("PI", PI); |
68 |
< |
funset("hermite", 5, l_hermite); |
69 |
< |
funset("bezier", 5, l_bezier); |
70 |
< |
funset("bspline", 5, l_bspline); |
67 |
> |
varset("PI", ':', PI); |
68 |
> |
funset("hermite", 5, ':', l_hermite); |
69 |
> |
funset("bezier", 5, ':', l_bezier); |
70 |
> |
funset("bspline", 5, ':', l_bspline); |
71 |
|
|
72 |
|
if (argc < 8) |
73 |
|
goto userror; |
74 |
|
|
75 |
|
for (i = 8; i < argc; i++) |
76 |
|
if (!strcmp(argv[i], "-e")) |
77 |
< |
scompile(NULL, argv[++i]); |
77 |
> |
scompile(argv[++i], NULL, 0); |
78 |
|
else if (!strcmp(argv[i], "-f")) |
79 |
|
fcompile(argv[++i]); |
80 |
|
else if (!strcmp(argv[i], "-s")) |
84 |
|
|
85 |
|
modname = argv[1]; |
86 |
|
surfname = argv[2]; |
73 |
– |
sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]); |
74 |
– |
scompile(NULL, stmp); |
75 |
– |
sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]); |
76 |
– |
scompile(NULL, stmp); |
77 |
– |
sprintf(stmp, "%s(s,t)=%s;", ZNAME, argv[5]); |
78 |
– |
scompile(NULL, stmp); |
87 |
|
m = atoi(argv[6]); |
88 |
|
n = atoi(argv[7]); |
89 |
|
if (m <= 0 || n <= 0) |
90 |
|
goto userror; |
91 |
< |
|
91 |
> |
if (!strcmp(argv[5], "-") || access(argv[5], 4) == 0) { /* file? */ |
92 |
> |
funset(ZNAME, 2, ':', l_dataval); |
93 |
> |
if (!strcmp(argv[5],argv[3]) && !strcmp(argv[5],argv[4])) { |
94 |
> |
loaddata(argv[5], m, n, 3); |
95 |
> |
funset(XNAME, 2, ':', l_dataval); |
96 |
> |
funset(YNAME, 2, ':', l_dataval); |
97 |
> |
} else { |
98 |
> |
loaddata(argv[5], m, n, 1); |
99 |
> |
sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]); |
100 |
> |
scompile(stmp, NULL, 0); |
101 |
> |
sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]); |
102 |
> |
scompile(stmp, NULL, 0); |
103 |
> |
} |
104 |
> |
} else { |
105 |
> |
sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]); |
106 |
> |
scompile(stmp, NULL, 0); |
107 |
> |
sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]); |
108 |
> |
scompile(stmp, NULL, 0); |
109 |
> |
sprintf(stmp, "%s(s,t)=%s;", ZNAME, argv[5]); |
110 |
> |
scompile(stmp, NULL, 0); |
111 |
> |
} |
112 |
|
row0 = (POINT *)malloc((n+3)*sizeof(POINT)); |
113 |
|
row1 = (POINT *)malloc((n+3)*sizeof(POINT)); |
114 |
|
row2 = (POINT *)malloc((n+3)*sizeof(POINT)); |
119 |
|
row0++; row1++; row2++; |
120 |
|
/* print header */ |
121 |
|
printhead(argc, argv); |
122 |
+ |
eclock = 0; |
123 |
|
/* initialize */ |
124 |
|
comprow(-1.0/m, row0, n); |
125 |
|
comprow(0.0, row1, n); |
136 |
|
compnorms(row0, row1, row2, n); |
137 |
|
|
138 |
|
for (j = 0; j < n; j++) { |
139 |
+ |
int orient = (j & 1); |
140 |
|
/* put polygons */ |
141 |
< |
if ((i+j) & 1) |
141 |
> |
if (!(row0[j].valid & row1[j+1].valid)) |
142 |
> |
orient = 1; |
143 |
> |
else if (!(row1[j].valid & row0[j+1].valid)) |
144 |
> |
orient = 0; |
145 |
> |
if (orient) |
146 |
|
putsquare(&row0[j], &row1[j], |
147 |
|
&row0[j+1], &row1[j+1]); |
148 |
|
else |
160 |
|
} |
161 |
|
|
162 |
|
|
163 |
+ |
loaddata(file, m, n, pointsize) /* load point data from file */ |
164 |
+ |
char *file; |
165 |
+ |
int m, n; |
166 |
+ |
int pointsize; |
167 |
+ |
{ |
168 |
+ |
FILE *fp; |
169 |
+ |
char word[64]; |
170 |
+ |
register int size; |
171 |
+ |
register FLOAT *dp; |
172 |
+ |
|
173 |
+ |
datarec.flags = HASBORDER; /* assume border values */ |
174 |
+ |
datarec.m = m+1; |
175 |
+ |
datarec.n = n+1; |
176 |
+ |
size = datarec.m*datarec.n*pointsize; |
177 |
+ |
if (pointsize == 3) |
178 |
+ |
datarec.flags |= TRIPLETS; |
179 |
+ |
dp = (FLOAT *)malloc(size*sizeof(FLOAT)); |
180 |
+ |
if ((datarec.data = dp) == NULL) { |
181 |
+ |
fputs("Out of memory\n", stderr); |
182 |
+ |
exit(1); |
183 |
+ |
} |
184 |
+ |
if (!strcmp(file, "-")) { |
185 |
+ |
file = "<stdin>"; |
186 |
+ |
fp = stdin; |
187 |
+ |
} else if ((fp = fopen(file, "r")) == NULL) { |
188 |
+ |
fputs(file, stderr); |
189 |
+ |
fputs(": cannot open\n", stderr); |
190 |
+ |
exit(1); |
191 |
+ |
} |
192 |
+ |
while (size > 0 && fgetword(word, sizeof(word), fp) != NULL) { |
193 |
+ |
if (!isflt(word)) { |
194 |
+ |
fprintf(stderr, "%s: garbled data value: %s\n", |
195 |
+ |
file, word); |
196 |
+ |
exit(1); |
197 |
+ |
} |
198 |
+ |
*dp++ = atof(word); |
199 |
+ |
size--; |
200 |
+ |
} |
201 |
+ |
if (size == (m+n+1)*pointsize) { /* no border after all */ |
202 |
+ |
dp = (FLOAT *)realloc((char *)datarec.data, |
203 |
+ |
m*n*pointsize*sizeof(FLOAT)); |
204 |
+ |
if (dp != NULL) |
205 |
+ |
datarec.data = dp; |
206 |
+ |
datarec.flags &= ~HASBORDER; |
207 |
+ |
datarec.m = m; |
208 |
+ |
datarec.n = n; |
209 |
+ |
size = 0; |
210 |
+ |
} |
211 |
+ |
if (datarec.m < 2 || datarec.n < 2 || size != 0 || |
212 |
+ |
fgetword(word, sizeof(word), fp) != NULL) { |
213 |
+ |
fputs(file, stderr); |
214 |
+ |
fputs(": bad number of data points\n", stderr); |
215 |
+ |
exit(1); |
216 |
+ |
} |
217 |
+ |
fclose(fp); |
218 |
+ |
} |
219 |
+ |
|
220 |
+ |
|
221 |
+ |
double |
222 |
+ |
l_dataval(nam) /* return recorded data value */ |
223 |
+ |
char *nam; |
224 |
+ |
{ |
225 |
+ |
double u, v; |
226 |
+ |
register int i, j; |
227 |
+ |
register FLOAT *dp; |
228 |
+ |
double d00, d01, d10, d11; |
229 |
+ |
/* compute coordinates */ |
230 |
+ |
u = argument(1); v = argument(2); |
231 |
+ |
if (datarec.flags & HASBORDER) { |
232 |
+ |
i = u *= datarec.m-1; |
233 |
+ |
j = v *= datarec.n-1; |
234 |
+ |
} else { |
235 |
+ |
i = u = u*datarec.m - .5; |
236 |
+ |
j = v = v*datarec.n - .5; |
237 |
+ |
} |
238 |
+ |
if (i < 0) i = 0; |
239 |
+ |
else if (i > datarec.m-2) i = datarec.m-2; |
240 |
+ |
if (j < 0) j = 0; |
241 |
+ |
else if (j > datarec.n-2) j = datarec.n-2; |
242 |
+ |
/* compute value */ |
243 |
+ |
if (datarec.flags & TRIPLETS) { |
244 |
+ |
dp = datarec.data + 3*(j*datarec.m + i); |
245 |
+ |
if (nam == ZNAME) |
246 |
+ |
dp += 2; |
247 |
+ |
else if (nam == YNAME) |
248 |
+ |
dp++; |
249 |
+ |
d00 = dp[0]; d01 = dp[3]; |
250 |
+ |
dp += 3*datarec.m; |
251 |
+ |
d10 = dp[0]; d11 = dp[3]; |
252 |
+ |
} else { |
253 |
+ |
dp = datarec.data + j*datarec.m + i; |
254 |
+ |
d00 = dp[0]; d01 = dp[1]; |
255 |
+ |
dp += datarec.m; |
256 |
+ |
d10 = dp[0]; d11 = dp[1]; |
257 |
+ |
} |
258 |
+ |
/* bilinear interpolation */ |
259 |
+ |
return((j+1-v)*((i+1-u)*d00+(u-i)*d01)+(v-j)*((i+1-u)*d10+(u-i)*d11)); |
260 |
+ |
} |
261 |
+ |
|
262 |
+ |
|
263 |
|
putsquare(p0, p1, p2, p3) /* put out a square */ |
264 |
|
POINT *p0, *p1, *p2, *p3; |
265 |
|
{ |
269 |
|
FVECT v1, v2, vc1, vc2; |
270 |
|
int ok1, ok2; |
271 |
|
/* compute exact normals */ |
272 |
< |
fvsum(v1, p1->p, p0->p, -1.0); |
273 |
< |
fvsum(v2, p2->p, p0->p, -1.0); |
274 |
< |
fcross(vc1, v1, v2); |
275 |
< |
ok1 = normalize(vc1) != 0.0; |
276 |
< |
fvsum(v1, p2->p, p3->p, -1.0); |
277 |
< |
fvsum(v2, p1->p, p3->p, -1.0); |
278 |
< |
fcross(vc2, v1, v2); |
279 |
< |
ok2 = normalize(vc2) != 0.0; |
272 |
> |
ok1 = (p0->valid & p1->valid & p2->valid); |
273 |
> |
if (ok1) { |
274 |
> |
fvsum(v1, p1->p, p0->p, -1.0); |
275 |
> |
fvsum(v2, p2->p, p0->p, -1.0); |
276 |
> |
fcross(vc1, v1, v2); |
277 |
> |
ok1 = (normalize(vc1) != 0.0); |
278 |
> |
} |
279 |
> |
ok2 = (p1->valid & p2->valid & p3->valid); |
280 |
> |
if (ok2) { |
281 |
> |
fvsum(v1, p2->p, p3->p, -1.0); |
282 |
> |
fvsum(v2, p1->p, p3->p, -1.0); |
283 |
> |
fcross(vc2, v1, v2); |
284 |
> |
ok2 = (normalize(vc2) != 0.0); |
285 |
> |
} |
286 |
|
if (!(ok1 | ok2)) |
287 |
|
return; |
288 |
|
/* compute normal interpolation */ |
359 |
|
int siz; |
360 |
|
{ |
361 |
|
double st[2]; |
362 |
+ |
int end; |
363 |
+ |
int checkvalid; |
364 |
|
register int i; |
365 |
< |
/* compute one past each end */ |
365 |
> |
|
366 |
> |
if (smooth) { |
367 |
> |
i = -1; /* compute one past each end */ |
368 |
> |
end = siz+1; |
369 |
> |
} else { |
370 |
> |
if (s < -FTINY || s > 1.0+FTINY) |
371 |
> |
return; |
372 |
> |
i = 0; |
373 |
> |
end = siz; |
374 |
> |
} |
375 |
|
st[0] = s; |
376 |
< |
for (i = -1; i <= siz+1; i++) { |
376 |
> |
checkvalid = (fundefined(VNAME) == 2); |
377 |
> |
while (i <= end) { |
378 |
|
st[1] = (double)i/siz; |
379 |
< |
row[i].p[0] = funvalue(XNAME, 2, st); |
380 |
< |
row[i].p[1] = funvalue(YNAME, 2, st); |
381 |
< |
row[i].p[2] = funvalue(ZNAME, 2, st); |
379 |
> |
if (checkvalid && funvalue(VNAME, 2, st) <= 0.0) { |
380 |
> |
row[i].valid = 0; |
381 |
> |
row[i].p[0] = row[i].p[1] = row[i].p[2] = 0.0; |
382 |
> |
} else { |
383 |
> |
row[i].valid = 1; |
384 |
> |
row[i].p[0] = funvalue(XNAME, 2, st); |
385 |
> |
row[i].p[1] = funvalue(YNAME, 2, st); |
386 |
> |
row[i].p[2] = funvalue(ZNAME, 2, st); |
387 |
> |
} |
388 |
> |
i++; |
389 |
|
} |
390 |
|
} |
391 |
|
|
394 |
|
register POINT *r0, *r1, *r2; |
395 |
|
int siz; |
396 |
|
{ |
397 |
< |
FVECT v1, v2, vc; |
239 |
< |
register int i; |
397 |
> |
FVECT v1, v2; |
398 |
|
|
399 |
|
if (!smooth) /* not needed if no smoothing */ |
400 |
|
return; |
401 |
< |
/* compute middle points */ |
401 |
> |
/* compute row 1 normals */ |
402 |
|
while (siz-- >= 0) { |
403 |
< |
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
404 |
< |
fvsum(v2, r1[1].p, r1[0].p, -1.0); |
403 |
> |
if (!r1[0].valid) |
404 |
> |
continue; |
405 |
> |
if (!r0[0].valid) { |
406 |
> |
if (!r2[0].valid) { |
407 |
> |
r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0; |
408 |
> |
continue; |
409 |
> |
} |
410 |
> |
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
411 |
> |
} else if (!r2[0].valid) |
412 |
> |
fvsum(v1, r1[0].p, r0[0].p, -1.0); |
413 |
> |
else |
414 |
> |
fvsum(v1, r2[0].p, r0[0].p, -1.0); |
415 |
> |
if (!r1[-1].valid) { |
416 |
> |
if (!r1[1].valid) { |
417 |
> |
r1[0].n[0] = r1[0].n[1] = r1[0].n[2] = 0.0; |
418 |
> |
continue; |
419 |
> |
} |
420 |
> |
fvsum(v2, r1[1].p, r1[0].p, -1.0); |
421 |
> |
} else if (!r1[1].valid) |
422 |
> |
fvsum(v2, r1[0].p, r1[-1].p, -1.0); |
423 |
> |
else |
424 |
> |
fvsum(v2, r1[1].p, r1[-1].p, -1.0); |
425 |
|
fcross(r1[0].n, v1, v2); |
248 |
– |
fvsum(v1, r0[0].p, r1[0].p, -1.0); |
249 |
– |
fcross(vc, v2, v1); |
250 |
– |
fvsum(r1[0].n, r1[0].n, vc, 1.0); |
251 |
– |
fvsum(v2, r1[-1].p, r1[0].p, -1.0); |
252 |
– |
fcross(vc, v1, v2); |
253 |
– |
fvsum(r1[0].n, r1[0].n, vc, 1.0); |
254 |
– |
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
255 |
– |
fcross(vc, v2, v1); |
256 |
– |
fvsum(r1[0].n, r1[0].n, vc, 1.0); |
426 |
|
normalize(r1[0].n); |
427 |
|
r0++; r1++; r2++; |
428 |
|
} |
438 |
|
#define v ((ax+2)%3) |
439 |
|
|
440 |
|
register int ax; |
441 |
< |
double eqnmat[4][4]; |
441 |
> |
MAT4 eqnmat; |
442 |
|
FVECT v1; |
443 |
|
register int i, j; |
444 |
|
|
469 |
|
eqnmat[3][2] = p3->p[v]; |
470 |
|
eqnmat[3][3] = 1.0; |
471 |
|
/* invert matrix (solve system) */ |
472 |
< |
if (!invmat(eqnmat, eqnmat)) |
472 |
> |
if (!invmat4(eqnmat, eqnmat)) |
473 |
|
return(-1); /* no solution */ |
474 |
|
/* compute result matrix */ |
475 |
|
for (j = 0; j < 4; j++) |
485 |
|
} |
486 |
|
|
487 |
|
|
488 |
< |
/* |
320 |
< |
* invmat - computes the inverse of mat into inverse. Returns 1 |
321 |
< |
* if there exists an inverse, 0 otherwise. It uses Gaussian Elimination |
322 |
< |
* method. |
323 |
< |
*/ |
324 |
< |
|
325 |
< |
invmat(inverse,mat) |
326 |
< |
double mat[4][4],inverse[4][4]; |
327 |
< |
{ |
328 |
< |
#define SWAP(a,b,t) (t=a,a=b,b=t) |
329 |
< |
|
330 |
< |
double m4tmp[4][4]; |
331 |
< |
register int i,j,k; |
332 |
< |
register double temp; |
333 |
< |
|
334 |
< |
bcopy((char *)mat, (char *)m4tmp, sizeof(m4tmp)); |
335 |
< |
/* set inverse to identity */ |
336 |
< |
for (i = 0; i < 4; i++) |
337 |
< |
for (j = 0; j < 4; j++) |
338 |
< |
inverse[i][j] = i==j ? 1.0 : 0.0; |
339 |
< |
|
340 |
< |
for(i = 0; i < 4; i++) { |
341 |
< |
/* Look for raw with largest pivot and swap raws */ |
342 |
< |
temp = FTINY; j = -1; |
343 |
< |
for(k = i; k < 4; k++) |
344 |
< |
if(ABS(m4tmp[k][i]) > temp) { |
345 |
< |
temp = ABS(m4tmp[k][i]); |
346 |
< |
j = k; |
347 |
< |
} |
348 |
< |
if(j == -1) /* No replacing raw -> no inverse */ |
349 |
< |
return(0); |
350 |
< |
if (j != i) |
351 |
< |
for(k = 0; k < 4; k++) { |
352 |
< |
SWAP(m4tmp[i][k],m4tmp[j][k],temp); |
353 |
< |
SWAP(inverse[i][k],inverse[j][k],temp); |
354 |
< |
} |
355 |
< |
|
356 |
< |
temp = m4tmp[i][i]; |
357 |
< |
for(k = 0; k < 4; k++) { |
358 |
< |
m4tmp[i][k] /= temp; |
359 |
< |
inverse[i][k] /= temp; |
360 |
< |
} |
361 |
< |
for(j = 0; j < 4; j++) { |
362 |
< |
if(j != i) { |
363 |
< |
temp = m4tmp[j][i]; |
364 |
< |
for(k = 0; k < 4; k++) { |
365 |
< |
m4tmp[j][k] -= m4tmp[i][k]*temp; |
366 |
< |
inverse[j][k] -= inverse[i][k]*temp; |
367 |
< |
} |
368 |
< |
} |
369 |
< |
} |
370 |
< |
} |
371 |
< |
return(1); |
372 |
< |
|
373 |
< |
#undef SWAP |
374 |
< |
} |
375 |
< |
|
376 |
< |
|
488 |
> |
void |
489 |
|
eputs(msg) |
490 |
|
char *msg; |
491 |
|
{ |
493 |
|
} |
494 |
|
|
495 |
|
|
496 |
+ |
void |
497 |
|
wputs(msg) |
498 |
|
char *msg; |
499 |
|
{ |
501 |
|
} |
502 |
|
|
503 |
|
|
504 |
+ |
void |
505 |
|
quit(code) |
506 |
+ |
int code; |
507 |
|
{ |
508 |
|
exit(code); |
509 |
|
} |