221 |
|
v[i] = beg[i] + s; |
222 |
|
} |
223 |
|
for (i = 0; i < 3; i++) { /* do edges */ |
224 |
< |
j = (i+1)%3; |
224 |
> |
if ((j = i+1) == 3) j = 0; |
225 |
|
if (branch & 1<<j) |
226 |
|
v[j] += s; |
227 |
|
else |
228 |
|
v[j] -= s; |
229 |
< |
j = (i+2)%3; |
229 |
> |
if (++j == 3) j = 0; |
230 |
|
if (branch & 1<<j) |
231 |
|
v[j] += s; |
232 |
|
else |
235 |
|
fc += fval[branch | 1<<i]; |
236 |
|
fc = 0.5*fc + s*EPSILON*frand3(v[0],v[1],v[2]); |
237 |
|
fval[branch^1<<i] = fc; |
238 |
< |
j = (i+1)%3; |
238 |
> |
if ((j = i+1) == 3) j = 0; |
239 |
|
v[j] = beg[j] + s; |
240 |
< |
j = (i+2)%3; |
240 |
> |
if (++j == 3) j = 0; |
241 |
|
v[j] = beg[j] + s; |
242 |
|
} |
243 |
|
for (i = 0; i < 3; i++) /* new cube */ |