| 248 |
|
register POINT *r0, *r1, *r2; |
| 249 |
|
int siz; |
| 250 |
|
{ |
| 251 |
< |
FVECT v1, v2, vc; |
| 251 |
> |
FVECT v1, v2; |
| 252 |
|
register int i; |
| 253 |
|
|
| 254 |
|
if (!smooth) /* not needed if no smoothing */ |
| 255 |
|
return; |
| 256 |
|
/* compute middle points */ |
| 257 |
|
while (siz-- >= 0) { |
| 258 |
< |
fvsum(v1, r2[0].p, r1[0].p, -1.0); |
| 259 |
< |
fvsum(v2, r1[1].p, r1[0].p, -1.0); |
| 258 |
> |
fvsum(v1, r2[0].p, r0[0].p, -1.0); |
| 259 |
> |
fvsum(v2, r1[1].p, r1[-1].p, -1.0); |
| 260 |
|
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); |
| 261 |
|
normalize(r1[0].n); |
| 262 |
|
r0++; r1++; r2++; |
| 263 |
|
} |
| 342 |
|
inverse[i][j] = i==j ? 1.0 : 0.0; |
| 343 |
|
|
| 344 |
|
for(i = 0; i < 4; i++) { |
| 345 |
< |
/* Look for raw with largest pivot and swap raws */ |
| 345 |
> |
/* Look for row with largest pivot and swap rows */ |
| 346 |
|
temp = FTINY; j = -1; |
| 347 |
|
for(k = i; k < 4; k++) |
| 348 |
|
if(ABS(m4tmp[k][i]) > temp) { |
| 349 |
|
temp = ABS(m4tmp[k][i]); |
| 350 |
|
j = k; |
| 351 |
|
} |
| 352 |
< |
if(j == -1) /* No replacing raw -> no inverse */ |
| 352 |
> |
if(j == -1) /* No replacing row -> no inverse */ |
| 353 |
|
return(0); |
| 354 |
|
if (j != i) |
| 355 |
|
for(k = 0; k < 4; k++) { |
