18 |
|
|
19 |
|
#include "standard.h" |
20 |
|
|
21 |
< |
#define XNAME "X_" /* x function name */ |
22 |
< |
#define YNAME "Y_" /* y function name */ |
23 |
< |
#define ZNAME "Z_" /* z function name */ |
21 |
> |
char XNAME[] = "X`SYS`"; /* x function name */ |
22 |
> |
char YNAME[] = "Y`SYS`"; /* y function name */ |
23 |
> |
char ZNAME[] = "Z`SYS`"; /* z function name */ |
24 |
|
|
25 |
|
#define ABS(x) ((x)>=0 ? (x) : -(x)) |
26 |
|
|
34 |
|
|
35 |
|
char *modname, *surfname; |
36 |
|
|
37 |
< |
double funvalue(), l_hermite(), l_bezier(), l_bspline(), argument(); |
37 |
> |
/* recorded data flags */ |
38 |
> |
#define HASBORDER 01 |
39 |
> |
#define TRIPLETS 02 |
40 |
> |
/* a data structure */ |
41 |
> |
struct { |
42 |
> |
int flags; /* data type */ |
43 |
> |
short m, n; /* number of s and t values */ |
44 |
> |
FLOAT *data; /* the data itself, s major sort */ |
45 |
> |
} datarec; /* our recorded data */ |
46 |
|
|
47 |
+ |
double l_hermite(), l_bezier(), l_bspline(), l_dataval(); |
48 |
+ |
extern double funvalue(), argument(); |
49 |
+ |
|
50 |
|
typedef struct { |
51 |
|
FVECT p; /* vertex position */ |
52 |
|
FVECT n; /* average normal */ |
62 |
|
int i, j, m, n; |
63 |
|
char stmp[256]; |
64 |
|
|
65 |
< |
varset("PI", PI); |
66 |
< |
funset("hermite", 5, l_hermite); |
67 |
< |
funset("bezier", 5, l_bezier); |
68 |
< |
funset("bspline", 5, l_bspline); |
65 |
> |
varset("PI", ':', PI); |
66 |
> |
funset("hermite", 5, ':', l_hermite); |
67 |
> |
funset("bezier", 5, ':', l_bezier); |
68 |
> |
funset("bspline", 5, ':', l_bspline); |
69 |
|
|
70 |
|
if (argc < 8) |
71 |
|
goto userror; |
72 |
|
|
73 |
|
for (i = 8; i < argc; i++) |
74 |
|
if (!strcmp(argv[i], "-e")) |
75 |
< |
scompile(NULL, argv[++i]); |
75 |
> |
scompile(argv[++i], NULL, 0); |
76 |
|
else if (!strcmp(argv[i], "-f")) |
77 |
|
fcompile(argv[++i]); |
78 |
|
else if (!strcmp(argv[i], "-s")) |
82 |
|
|
83 |
|
modname = argv[1]; |
84 |
|
surfname = argv[2]; |
74 |
– |
sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]); |
75 |
– |
scompile(NULL, stmp); |
76 |
– |
sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]); |
77 |
– |
scompile(NULL, stmp); |
78 |
– |
sprintf(stmp, "%s(s,t)=%s;", ZNAME, argv[5]); |
79 |
– |
scompile(NULL, stmp); |
85 |
|
m = atoi(argv[6]); |
86 |
|
n = atoi(argv[7]); |
87 |
|
if (m <= 0 || n <= 0) |
88 |
|
goto userror; |
89 |
< |
|
89 |
> |
if (!strcmp(argv[5], "-") || access(argv[5], 4) == 0) { /* file? */ |
90 |
> |
funset(ZNAME, 2, ':', l_dataval); |
91 |
> |
if (!strcmp(argv[5],argv[3]) && !strcmp(argv[5],argv[4])) { |
92 |
> |
loaddata(argv[5], m, n, 3); |
93 |
> |
funset(XNAME, 2, ':', l_dataval); |
94 |
> |
funset(YNAME, 2, ':', l_dataval); |
95 |
> |
} else { |
96 |
> |
loaddata(argv[5], m, n, 1); |
97 |
> |
sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]); |
98 |
> |
scompile(stmp, NULL, 0); |
99 |
> |
sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]); |
100 |
> |
scompile(stmp, NULL, 0); |
101 |
> |
} |
102 |
> |
} else { |
103 |
> |
sprintf(stmp, "%s(s,t)=%s;", XNAME, argv[3]); |
104 |
> |
scompile(stmp, NULL, 0); |
105 |
> |
sprintf(stmp, "%s(s,t)=%s;", YNAME, argv[4]); |
106 |
> |
scompile(stmp, NULL, 0); |
107 |
> |
sprintf(stmp, "%s(s,t)=%s;", ZNAME, argv[5]); |
108 |
> |
scompile(stmp, NULL, 0); |
109 |
> |
} |
110 |
|
row0 = (POINT *)malloc((n+3)*sizeof(POINT)); |
111 |
|
row1 = (POINT *)malloc((n+3)*sizeof(POINT)); |
112 |
|
row2 = (POINT *)malloc((n+3)*sizeof(POINT)); |
153 |
|
} |
154 |
|
|
155 |
|
|
156 |
+ |
loaddata(file, m, n, pointsize) /* load point data from file */ |
157 |
+ |
char *file; |
158 |
+ |
int m, n; |
159 |
+ |
int pointsize; |
160 |
+ |
{ |
161 |
+ |
extern char *fgetword(); |
162 |
+ |
FILE *fp; |
163 |
+ |
char word[64]; |
164 |
+ |
register int size; |
165 |
+ |
register FLOAT *dp; |
166 |
+ |
|
167 |
+ |
datarec.flags = HASBORDER; /* assume border values */ |
168 |
+ |
datarec.m = m+1; |
169 |
+ |
datarec.n = n+1; |
170 |
+ |
size = datarec.m*datarec.n*pointsize; |
171 |
+ |
if (pointsize == 3) |
172 |
+ |
datarec.flags |= TRIPLETS; |
173 |
+ |
dp = (FLOAT *)malloc(size*sizeof(FLOAT)); |
174 |
+ |
if ((datarec.data = dp) == NULL) { |
175 |
+ |
fputs("Out of memory\n", stderr); |
176 |
+ |
exit(1); |
177 |
+ |
} |
178 |
+ |
if (!strcmp(file, "-")) { |
179 |
+ |
file = "<stdin>"; |
180 |
+ |
fp = stdin; |
181 |
+ |
} else if ((fp = fopen(file, "r")) == NULL) { |
182 |
+ |
fputs(file, stderr); |
183 |
+ |
fputs(": cannot open\n", stderr); |
184 |
+ |
exit(1); |
185 |
+ |
} |
186 |
+ |
while (size > 0 && fgetword(word, sizeof(word), fp) != NULL) { |
187 |
+ |
if (!isflt(word)) { |
188 |
+ |
fprintf(stderr, "%s: garbled data value: %s\n", |
189 |
+ |
file, word); |
190 |
+ |
exit(1); |
191 |
+ |
} |
192 |
+ |
*dp++ = atof(word); |
193 |
+ |
size--; |
194 |
+ |
} |
195 |
+ |
if (size == (m+n+1)*pointsize) { /* no border after all */ |
196 |
+ |
dp = (FLOAT *)realloc((char *)datarec.data, |
197 |
+ |
m*n*pointsize*sizeof(FLOAT)); |
198 |
+ |
if (dp != NULL) |
199 |
+ |
datarec.data = dp; |
200 |
+ |
datarec.flags &= ~HASBORDER; |
201 |
+ |
datarec.m = m; |
202 |
+ |
datarec.n = n; |
203 |
+ |
size = 0; |
204 |
+ |
} |
205 |
+ |
if (datarec.m < 2 || datarec.n < 2 || size != 0 || |
206 |
+ |
fgetword(word, sizeof(word), fp) != NULL) { |
207 |
+ |
fputs(file, stderr); |
208 |
+ |
fputs(": bad number of data points\n", stderr); |
209 |
+ |
exit(1); |
210 |
+ |
} |
211 |
+ |
fclose(fp); |
212 |
+ |
} |
213 |
+ |
|
214 |
+ |
|
215 |
+ |
double |
216 |
+ |
l_dataval(nam) /* return recorded data value */ |
217 |
+ |
char *nam; |
218 |
+ |
{ |
219 |
+ |
double u, v; |
220 |
+ |
register int i, j; |
221 |
+ |
register FLOAT *dp; |
222 |
+ |
double d00, d01, d10, d11; |
223 |
+ |
/* compute coordinates */ |
224 |
+ |
u = argument(1); v = argument(2); |
225 |
+ |
if (datarec.flags & HASBORDER) { |
226 |
+ |
i = u *= datarec.m-1; |
227 |
+ |
j = v *= datarec.n-1; |
228 |
+ |
} else { |
229 |
+ |
i = u = u*datarec.m - .5; |
230 |
+ |
j = v = v*datarec.n - .5; |
231 |
+ |
} |
232 |
+ |
if (i < 0) i = 0; |
233 |
+ |
else if (i > datarec.m-2) i = datarec.m-2; |
234 |
+ |
if (j < 0) j = 0; |
235 |
+ |
else if (j > datarec.n-2) j = datarec.n-2; |
236 |
+ |
/* compute value */ |
237 |
+ |
if (datarec.flags & TRIPLETS) { |
238 |
+ |
dp = datarec.data + 3*(j*datarec.m + i); |
239 |
+ |
if (nam == ZNAME) |
240 |
+ |
dp += 2; |
241 |
+ |
else if (nam == YNAME) |
242 |
+ |
dp++; |
243 |
+ |
d00 = dp[0]; d01 = dp[3]; |
244 |
+ |
dp += 3*datarec.m; |
245 |
+ |
d10 = dp[0]; d11 = dp[3]; |
246 |
+ |
} else { |
247 |
+ |
dp = datarec.data + j*datarec.m + i; |
248 |
+ |
d00 = dp[0]; d01 = dp[1]; |
249 |
+ |
dp += datarec.m; |
250 |
+ |
d10 = dp[0]; d11 = dp[1]; |
251 |
+ |
} |
252 |
+ |
/* bilinear interpolation */ |
253 |
+ |
return((j+1-v)*((i+1-u)*d00+(u-i)*d01)+(v-j)*((i+1-u)*d10+(u-i)*d11)); |
254 |
+ |
} |
255 |
+ |
|
256 |
+ |
|
257 |
|
putsquare(p0, p1, p2, p3) /* put out a square */ |
258 |
|
POINT *p0, *p1, *p2, *p3; |
259 |
|
{ |
374 |
|
register POINT *r0, *r1, *r2; |
375 |
|
int siz; |
376 |
|
{ |
377 |
< |
FVECT v1, v2, vc; |
252 |
< |
register int i; |
377 |
> |
FVECT v1, v2; |
378 |
|
|
379 |
|
if (!smooth) /* not needed if no smoothing */ |
380 |
|
return; |
381 |
|
/* compute middle points */ |
382 |
|
while (siz-- >= 0) { |
383 |
< |
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
384 |
< |
fvsum(v2, r1[1].p, r1[0].p, -1.0); |
383 |
> |
fvsum(v1, r2[0].p, r0[0].p, -1.0); |
384 |
> |
fvsum(v2, r1[1].p, r1[-1].p, -1.0); |
385 |
|
fcross(r1[0].n, v1, v2); |
261 |
– |
fvsum(v1, r0[0].p, r1[0].p, -1.0); |
262 |
– |
fcross(vc, v2, v1); |
263 |
– |
fvsum(r1[0].n, r1[0].n, vc, 1.0); |
264 |
– |
fvsum(v2, r1[-1].p, r1[0].p, -1.0); |
265 |
– |
fcross(vc, v1, v2); |
266 |
– |
fvsum(r1[0].n, r1[0].n, vc, 1.0); |
267 |
– |
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
268 |
– |
fcross(vc, v2, v1); |
269 |
– |
fvsum(r1[0].n, r1[0].n, vc, 1.0); |
386 |
|
normalize(r1[0].n); |
387 |
|
r0++; r1++; r2++; |
388 |
|
} |
398 |
|
#define v ((ax+2)%3) |
399 |
|
|
400 |
|
register int ax; |
401 |
< |
double eqnmat[4][4]; |
401 |
> |
MAT4 eqnmat; |
402 |
|
FVECT v1; |
403 |
|
register int i, j; |
404 |
|
|
429 |
|
eqnmat[3][2] = p3->p[v]; |
430 |
|
eqnmat[3][3] = 1.0; |
431 |
|
/* invert matrix (solve system) */ |
432 |
< |
if (!invmat(eqnmat, eqnmat)) |
432 |
> |
if (!invmat4(eqnmat, eqnmat)) |
433 |
|
return(-1); /* no solution */ |
434 |
|
/* compute result matrix */ |
435 |
|
for (j = 0; j < 4; j++) |
445 |
|
} |
446 |
|
|
447 |
|
|
332 |
– |
/* |
333 |
– |
* invmat - computes the inverse of mat into inverse. Returns 1 |
334 |
– |
* if there exists an inverse, 0 otherwise. It uses Gaussian Elimination |
335 |
– |
* method. |
336 |
– |
*/ |
337 |
– |
|
338 |
– |
invmat(inverse,mat) |
339 |
– |
double mat[4][4],inverse[4][4]; |
340 |
– |
{ |
341 |
– |
#define SWAP(a,b,t) (t=a,a=b,b=t) |
342 |
– |
|
343 |
– |
double m4tmp[4][4]; |
344 |
– |
register int i,j,k; |
345 |
– |
register double temp; |
346 |
– |
|
347 |
– |
bcopy((char *)mat, (char *)m4tmp, sizeof(m4tmp)); |
348 |
– |
/* set inverse to identity */ |
349 |
– |
for (i = 0; i < 4; i++) |
350 |
– |
for (j = 0; j < 4; j++) |
351 |
– |
inverse[i][j] = i==j ? 1.0 : 0.0; |
352 |
– |
|
353 |
– |
for(i = 0; i < 4; i++) { |
354 |
– |
/* Look for raw with largest pivot and swap raws */ |
355 |
– |
temp = FTINY; j = -1; |
356 |
– |
for(k = i; k < 4; k++) |
357 |
– |
if(ABS(m4tmp[k][i]) > temp) { |
358 |
– |
temp = ABS(m4tmp[k][i]); |
359 |
– |
j = k; |
360 |
– |
} |
361 |
– |
if(j == -1) /* No replacing raw -> no inverse */ |
362 |
– |
return(0); |
363 |
– |
if (j != i) |
364 |
– |
for(k = 0; k < 4; k++) { |
365 |
– |
SWAP(m4tmp[i][k],m4tmp[j][k],temp); |
366 |
– |
SWAP(inverse[i][k],inverse[j][k],temp); |
367 |
– |
} |
368 |
– |
|
369 |
– |
temp = m4tmp[i][i]; |
370 |
– |
for(k = 0; k < 4; k++) { |
371 |
– |
m4tmp[i][k] /= temp; |
372 |
– |
inverse[i][k] /= temp; |
373 |
– |
} |
374 |
– |
for(j = 0; j < 4; j++) { |
375 |
– |
if(j != i) { |
376 |
– |
temp = m4tmp[j][i]; |
377 |
– |
for(k = 0; k < 4; k++) { |
378 |
– |
m4tmp[j][k] -= m4tmp[i][k]*temp; |
379 |
– |
inverse[j][k] -= inverse[i][k]*temp; |
380 |
– |
} |
381 |
– |
} |
382 |
– |
} |
383 |
– |
} |
384 |
– |
return(1); |
385 |
– |
|
386 |
– |
#undef SWAP |
387 |
– |
} |
388 |
– |
|
389 |
– |
|
448 |
|
eputs(msg) |
449 |
|
char *msg; |
450 |
|
{ |
460 |
|
|
461 |
|
|
462 |
|
quit(code) |
463 |
+ |
int code; |
464 |
|
{ |
465 |
|
exit(code); |
466 |
|
} |