| 55 |
|
VCROSS(va, vab, vcb); |
| 56 |
|
bcm->ax = ABS(va[0]) > ABS(va[1]) ? 0 : 1; |
| 57 |
|
bcm->ax = ABS(va[bcm->ax]) > ABS(va[2]) ? bcm->ax : 2; |
| 58 |
< |
ax0 = (bcm->ax + 1) % 3; |
| 59 |
< |
ax1 = (bcm->ax + 2) % 3; |
| 58 |
> |
if ((ax0 = bcm->ax + 1) >= 3) ax0 -= 3; |
| 59 |
> |
if ((ax1 = ax0 + 1) >= 3) ax1 -= 3; |
| 60 |
|
for (i = 0; i < 2; i++) { |
| 61 |
|
vab[0] = v1[ax0] - v2[ax0]; |
| 62 |
|
vcb[0] = v3[ax0] - v2[ax0]; |
| 92 |
|
register BARYCCM *bcm; |
| 93 |
|
{ |
| 94 |
|
double u, v; |
| 95 |
+ |
int i; |
| 96 |
|
|
| 97 |
< |
u = p[(bcm->ax + 1) % 3]; |
| 98 |
< |
v = p[(bcm->ax + 2) % 3]; |
| 97 |
> |
if ((i = bcm->ax + 1) >= 3) i -= 3; |
| 98 |
> |
u = p[i]; |
| 99 |
> |
if (++i >= 3) i -= 3; |
| 100 |
> |
v = p[i]; |
| 101 |
|
wt[0] = u*bcm->tm[0][0] + v*bcm->tm[0][1] + bcm->tm[0][2]; |
| 102 |
|
wt[1] = u*bcm->tm[1][0] + v*bcm->tm[1][1] + bcm->tm[1][2]; |
| 103 |
|
wt[2] = 1. - wt[1] - wt[0]; |
| 154 |
|
int n; |
| 155 |
|
{ |
| 156 |
|
double a, b; |
| 157 |
< |
register int i, j; |
| 157 |
> |
register int i; |
| 158 |
|
|
| 159 |
|
printf("%d\t%d\n", 1+3*n, bcm->ax); |
| 160 |
|
for (i = 0; i < n; i++) { |
