58 |
|
|
59 |
|
typedef struct { |
60 |
|
int valid; /* point is valid (vertex number) */ |
61 |
+ |
int nvalid; /* normal is valid */ |
62 |
|
FVECT p; /* vertex position */ |
63 |
|
FVECT n; /* average normal */ |
64 |
|
RREAL uv[2]; /* (u,v) position */ |
65 |
|
} POINT; |
66 |
|
|
67 |
+ |
int nverts = 0; /* vertex output count */ |
68 |
+ |
int nnorms = 0; /* normal output count */ |
69 |
|
|
70 |
|
void loaddata(char *file, int m, int n, int pointsize); |
71 |
|
double l_dataval(char *nam); |
72 |
|
void putobjrow(POINT *rp, int n); |
73 |
+ |
void putobjvert(POINT *p); |
74 |
|
void putsquare(POINT *p0, POINT *p1, POINT *p2, POINT *p3); |
75 |
|
void comprow(double s, POINT *row, int siz); |
76 |
|
void compnorms(POINT *r0, POINT *r1, POINT *r2, int siz); |
201 |
|
{ |
202 |
|
FILE *fp; |
203 |
|
char word[64]; |
204 |
< |
register int size; |
205 |
< |
register RREAL *dp; |
204 |
> |
int size; |
205 |
> |
RREAL *dp; |
206 |
|
|
207 |
|
datarec.flags = HASBORDER; /* assume border values */ |
208 |
|
datarec.m = m+1; |
233 |
|
size--; |
234 |
|
} |
235 |
|
if (size == (m+n+1)*pointsize) { /* no border after all */ |
236 |
< |
dp = (RREAL *)realloc((void *)datarec.data, |
236 |
> |
dp = (RREAL *)realloc(datarec.data, |
237 |
|
m*n*pointsize*sizeof(RREAL)); |
238 |
|
if (dp != NULL) |
239 |
|
datarec.data = dp; |
258 |
|
) |
259 |
|
{ |
260 |
|
double u, v; |
261 |
< |
register int i, j; |
262 |
< |
register RREAL *dp; |
261 |
> |
int i, j; |
262 |
> |
RREAL *dp; |
263 |
|
double d00, d01, d10, d11; |
264 |
|
/* compute coordinates */ |
265 |
|
u = argument(1); v = argument(2); |
297 |
|
|
298 |
|
void |
299 |
|
putobjrow( /* output vertex row to .OBJ */ |
300 |
< |
register POINT *rp, |
300 |
> |
POINT *rp, |
301 |
|
int n |
302 |
|
) |
303 |
|
{ |
300 |
– |
static int nverts = 0; |
301 |
– |
|
304 |
|
for ( ; n-- >= 0; rp++) { |
305 |
|
if (!rp->valid) |
306 |
|
continue; |
307 |
|
fputs("v ", stdout); |
308 |
|
pvect(rp->p); |
309 |
< |
if (smooth && !ZEROVECT(rp->n)) |
309 |
> |
if (smooth && !ZEROVECT(rp->n)) { |
310 |
|
printf("\tvn %.9g %.9g %.9g\n", |
311 |
|
rp->n[0], rp->n[1], rp->n[2]); |
312 |
+ |
rp->nvalid = ++nnorms; |
313 |
+ |
} else |
314 |
+ |
rp->nvalid = 0; |
315 |
|
printf("\tvt %.9g %.9g\n", rp->uv[0], rp->uv[1]); |
316 |
|
rp->valid = ++nverts; |
317 |
|
} |
319 |
|
|
320 |
|
|
321 |
|
void |
322 |
+ |
putobjvert( /* put out OBJ vertex index triplet */ |
323 |
+ |
POINT *p |
324 |
+ |
) |
325 |
+ |
{ |
326 |
+ |
int pti = p->valid ? p->valid-nverts-1 : 0; |
327 |
+ |
int ni = p->nvalid ? p->nvalid-nnorms-1 : 0; |
328 |
+ |
|
329 |
+ |
printf(" %d/%d/%d", pti, pti, ni); |
330 |
+ |
} |
331 |
+ |
|
332 |
+ |
|
333 |
+ |
void |
334 |
|
putsquare( /* put out a square */ |
335 |
|
POINT *p0, |
336 |
|
POINT *p1, |
361 |
|
if (!(ok1 | ok2)) |
362 |
|
return; |
363 |
|
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 |
– |
} |
364 |
|
if (ok1 & ok2 && fdot(vc1,vc2) >= 1.0-FTINY*FTINY) { |
365 |
< |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d %d/%d/%d\n", |
366 |
< |
p0->valid, p0->valid, p0n, |
367 |
< |
p1->valid, p1->valid, p1n, |
368 |
< |
p3->valid, p3->valid, p3n, |
363 |
< |
p2->valid, p2->valid, p2n); |
365 |
> |
putc('f', stdout); |
366 |
> |
putobjvert(p0); putobjvert(p1); |
367 |
> |
putobjvert(p3); putobjvert(p2); |
368 |
> |
putc('\n', stdout); |
369 |
|
return; |
370 |
|
} |
371 |
< |
if (ok1) |
372 |
< |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d\n", |
373 |
< |
p0->valid, p0->valid, p0n, |
374 |
< |
p1->valid, p1->valid, p1n, |
375 |
< |
p2->valid, p2->valid, p2n); |
376 |
< |
if (ok2) |
377 |
< |
printf("f %d/%d/%d %d/%d/%d %d/%d/%d\n", |
378 |
< |
p2->valid, p2->valid, p2n, |
379 |
< |
p1->valid, p1->valid, p1n, |
380 |
< |
p3->valid, p3->valid, p3n); |
371 |
> |
if (ok1) { |
372 |
> |
putc('f', stdout); |
373 |
> |
putobjvert(p0); putobjvert(p1); putobjvert(p2); |
374 |
> |
putc('\n', stdout); |
375 |
> |
} |
376 |
> |
if (ok2) { |
377 |
> |
putc('f', stdout); |
378 |
> |
putobjvert(p2); putobjvert(p1); putobjvert(p3); |
379 |
> |
putc('\n', stdout); |
380 |
> |
} |
381 |
|
return; |
382 |
|
} |
383 |
|
/* compute normal interpolation */ |
448 |
|
void |
449 |
|
comprow( /* compute row of values */ |
450 |
|
double s, |
451 |
< |
register POINT *row, |
451 |
> |
POINT *row, |
452 |
|
int siz |
453 |
|
) |
454 |
|
{ |
455 |
|
double st[2]; |
456 |
|
int end; |
457 |
|
int checkvalid; |
458 |
< |
register int i; |
458 |
> |
int i; |
459 |
|
|
460 |
|
if (smooth) { |
461 |
|
i = -1; /* compute one past each end */ |
489 |
|
|
490 |
|
void |
491 |
|
compnorms( /* compute row of averaged normals */ |
492 |
< |
register POINT *r0, |
493 |
< |
register POINT *r1, |
494 |
< |
register POINT *r2, |
492 |
> |
POINT *r0, |
493 |
> |
POINT *r1, |
494 |
> |
POINT *r2, |
495 |
|
int siz |
496 |
|
) |
497 |
|
{ |
532 |
|
|
533 |
|
int |
534 |
|
norminterp( /* compute normal interpolation */ |
535 |
< |
register FVECT resmat[4], |
535 |
> |
FVECT resmat[4], |
536 |
|
POINT *p0, |
537 |
|
POINT *p1, |
538 |
|
POINT *p2, |
542 |
|
#define u ((ax+1)%3) |
543 |
|
#define v ((ax+2)%3) |
544 |
|
|
545 |
< |
register int ax; |
545 |
> |
int ax; |
546 |
|
MAT4 eqnmat; |
547 |
|
FVECT v1; |
548 |
< |
register int i, j; |
548 |
> |
int i, j; |
549 |
|
|
550 |
|
if (!smooth) /* no interpolation if no smoothing */ |
551 |
|
return(-1); |