| 21 |
|
#include "ambient.h" |
| 22 |
|
#include "random.h" |
| 23 |
|
|
| 24 |
< |
#ifndef OLDAMB |
| 24 |
> |
#ifndef MINADIV |
| 25 |
> |
#define MINADIV 7 /* minimum # divisions in each dimension */ |
| 26 |
> |
#endif |
| 27 |
|
|
| 26 |
– |
extern void SDsquare2disk(double ds[2], double seedx, double seedy); |
| 27 |
– |
|
| 28 |
|
typedef struct { |
| 29 |
– |
COLOR v; /* hemisphere sample value */ |
| 30 |
– |
float d; /* reciprocal distance */ |
| 29 |
|
FVECT p; /* intersection point */ |
| 30 |
+ |
float d; /* reciprocal distance */ |
| 31 |
+ |
SCOLOR v; /* hemisphere sample value */ |
| 32 |
|
} AMBSAMP; /* sample value */ |
| 33 |
|
|
| 34 |
|
typedef struct { |
| 35 |
|
RAY *rp; /* originating ray sample */ |
| 36 |
|
int ns; /* number of samples per axis */ |
| 37 |
|
int sampOK; /* acquired full sample set? */ |
| 38 |
< |
COLOR acoef; /* division contribution coefficient */ |
| 39 |
< |
double acol[3]; /* accumulated color */ |
| 38 |
> |
int atyp; /* RAMBIENT or TAMBIENT */ |
| 39 |
> |
SCOLOR acoef; /* division contribution coefficient */ |
| 40 |
> |
SCOLOR acol; /* accumulated color */ |
| 41 |
> |
FVECT onrm; /* oriented unperturbed surface normal */ |
| 42 |
|
FVECT ux, uy; /* tangent axis unit vectors */ |
| 43 |
|
AMBSAMP sa[1]; /* sample array (extends struct) */ |
| 44 |
|
} AMBHEMI; /* ambient sample hemisphere */ |
| 100 |
|
AMBSAMP *ap = &ambsam(hp,i,j); |
| 101 |
|
RAY ar; |
| 102 |
|
int hlist[3], ii; |
| 103 |
< |
double spt[2], zd; |
| 103 |
> |
double ss[2]; |
| 104 |
> |
RREAL spt[2]; |
| 105 |
> |
double zd; |
| 106 |
|
/* generate hemispherical sample */ |
| 107 |
|
/* ambient coefficient for weight */ |
| 108 |
|
if (ambacc > FTINY) |
| 109 |
< |
setcolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL); |
| 109 |
> |
setscolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL); |
| 110 |
|
else |
| 111 |
< |
copycolor(ar.rcoef, hp->acoef); |
| 112 |
< |
if (rayorigin(&ar, AMBIENT, hp->rp, ar.rcoef) < 0) |
| 111 |
> |
copyscolor(ar.rcoef, hp->acoef); |
| 112 |
> |
if (rayorigin(&ar, hp->atyp, hp->rp, ar.rcoef) < 0) |
| 113 |
|
return(0); |
| 114 |
|
if (ambacc > FTINY) { |
| 115 |
< |
multcolor(ar.rcoef, hp->acoef); |
| 116 |
< |
scalecolor(ar.rcoef, 1./AVGREFL); |
| 115 |
> |
#ifdef SSKIPOPT |
| 116 |
> |
ar.rsrc = -1; /* protect cache from source opt. */ |
| 117 |
> |
ar.scorr = 1.f; |
| 118 |
> |
#endif |
| 119 |
> |
smultscolor(ar.rcoef, hp->acoef); |
| 120 |
> |
scalescolor(ar.rcoef, 1./AVGREFL); |
| 121 |
|
} |
| 122 |
|
hlist[0] = hp->rp->rno; |
| 123 |
< |
hlist[1] = j; |
| 124 |
< |
hlist[2] = i; |
| 125 |
< |
multisamp(spt, 2, urand(ilhash(hlist,3)+n)); |
| 123 |
> |
hlist[1] = AI(hp,i,j); |
| 124 |
> |
hlist[2] = samplendx; |
| 125 |
> |
multisamp(ss, 2, urand(ilhash(hlist,3)+n)); |
| 126 |
|
resample: |
| 127 |
< |
SDsquare2disk(spt, (j+spt[1])/hp->ns, (i+spt[0])/hp->ns); |
| 127 |
> |
square2disk(spt, (j+ss[1])/hp->ns, (i+ss[0])/hp->ns); |
| 128 |
|
zd = sqrt(1. - spt[0]*spt[0] - spt[1]*spt[1]); |
| 129 |
|
for (ii = 3; ii--; ) |
| 130 |
|
ar.rdir[ii] = spt[0]*hp->ux[ii] + |
| 131 |
|
spt[1]*hp->uy[ii] + |
| 132 |
< |
zd*hp->rp->ron[ii]; |
| 132 |
> |
zd*hp->onrm[ii]; |
| 133 |
|
checknorm(ar.rdir); |
| 134 |
|
/* avoid coincident samples */ |
| 135 |
< |
if (!n && ambcollision(hp, i, j, ar.rdir)) { |
| 136 |
< |
spt[0] = frandom(); spt[1] = frandom(); |
| 135 |
> |
if (!n && hp->ns >= 4 && ambcollision(hp, i, j, ar.rdir)) { |
| 136 |
> |
ss[0] = frandom(); ss[1] = frandom(); |
| 137 |
|
goto resample; /* reject this sample */ |
| 138 |
|
} |
| 139 |
|
dimlist[ndims++] = AI(hp,i,j) + 90171; |
| 142 |
|
zd = raydistance(&ar); |
| 143 |
|
if (zd <= FTINY) |
| 144 |
|
return(0); /* should never happen */ |
| 145 |
< |
multcolor(ar.rcol, ar.rcoef); /* apply coefficient */ |
| 145 |
> |
smultscolor(ar.rcol, ar.rcoef); /* apply coefficient */ |
| 146 |
|
if (zd*ap->d < 1.0) /* new/closer distance? */ |
| 147 |
|
ap->d = 1.0/zd; |
| 148 |
|
if (!n) { /* record first vertex & value */ |
| 149 |
|
if (zd > 10.0*thescene.cusize + 1000.) |
| 150 |
|
zd = 10.0*thescene.cusize + 1000.; |
| 151 |
|
VSUM(ap->p, ar.rorg, ar.rdir, zd); |
| 152 |
< |
copycolor(ap->v, ar.rcol); |
| 152 |
> |
copyscolor(ap->v, ar.rcol); |
| 153 |
|
} else { /* else update recorded value */ |
| 154 |
< |
hp->acol[RED] -= colval(ap->v,RED); |
| 147 |
< |
hp->acol[GRN] -= colval(ap->v,GRN); |
| 148 |
< |
hp->acol[BLU] -= colval(ap->v,BLU); |
| 154 |
> |
sopscolor(hp->acol, -=, ap->v); |
| 155 |
|
zd = 1.0/(double)(n+1); |
| 156 |
< |
scalecolor(ar.rcol, zd); |
| 156 |
> |
scalescolor(ar.rcol, zd); |
| 157 |
|
zd *= (double)n; |
| 158 |
< |
scalecolor(ap->v, zd); |
| 159 |
< |
addcolor(ap->v, ar.rcol); |
| 158 |
> |
scalescolor(ap->v, zd); |
| 159 |
> |
saddscolor(ap->v, ar.rcol); |
| 160 |
|
} |
| 161 |
< |
addcolor(hp->acol, ap->v); /* add to our sum */ |
| 161 |
> |
saddscolor(hp->acol, ap->v); /* add to our sum */ |
| 162 |
|
return(1); |
| 163 |
|
} |
| 164 |
|
|
| 167 |
|
static float * |
| 168 |
|
getambdiffs(AMBHEMI *hp) |
| 169 |
|
{ |
| 170 |
< |
const double normf = 1./bright(hp->acoef); |
| 171 |
< |
float *earr = (float *)calloc(hp->ns*hp->ns, sizeof(float)); |
| 170 |
> |
const double normf = 1./(pbright(hp->acoef) + FTINY); |
| 171 |
> |
float *earr = (float *)calloc(2*hp->ns*hp->ns, sizeof(float)); |
| 172 |
|
float *ep; |
| 173 |
|
AMBSAMP *ap; |
| 174 |
|
double b, b1, d2; |
| 177 |
|
if (earr == NULL) /* out of memory? */ |
| 178 |
|
return(NULL); |
| 179 |
|
/* sum squared neighbor diffs */ |
| 180 |
< |
for (ap = hp->sa, ep = earr, i = 0; i < hp->ns; i++) |
| 180 |
> |
ap = hp->sa; |
| 181 |
> |
ep = earr + hp->ns*hp->ns; /* original estimates to scratch */ |
| 182 |
> |
for (i = 0; i < hp->ns; i++) |
| 183 |
|
for (j = 0; j < hp->ns; j++, ap++, ep++) { |
| 184 |
< |
b = bright(ap[0].v); |
| 184 |
> |
b = pbright(ap[0].v); |
| 185 |
|
if (i) { /* from above */ |
| 186 |
< |
b1 = bright(ap[-hp->ns].v); |
| 186 |
> |
b1 = pbright(ap[-hp->ns].v); |
| 187 |
|
d2 = b - b1; |
| 188 |
< |
d2 *= d2*normf/(b + b1); |
| 188 |
> |
d2 *= d2*normf/(b + b1 + FTINY); |
| 189 |
|
ep[0] += d2; |
| 190 |
|
ep[-hp->ns] += d2; |
| 191 |
|
} |
| 192 |
|
if (!j) continue; |
| 193 |
|
/* from behind */ |
| 194 |
< |
b1 = bright(ap[-1].v); |
| 194 |
> |
b1 = pbright(ap[-1].v); |
| 195 |
|
d2 = b - b1; |
| 196 |
< |
d2 *= d2*normf/(b + b1); |
| 196 |
> |
d2 *= d2*normf/(b + b1 + FTINY); |
| 197 |
|
ep[0] += d2; |
| 198 |
|
ep[-1] += d2; |
| 199 |
|
if (!i) continue; |
| 200 |
|
/* diagonal */ |
| 201 |
< |
b1 = bright(ap[-hp->ns-1].v); |
| 201 |
> |
b1 = pbright(ap[-hp->ns-1].v); |
| 202 |
|
d2 = b - b1; |
| 203 |
< |
d2 *= d2*normf/(b + b1); |
| 203 |
> |
d2 *= d2*normf/(b + b1 + FTINY); |
| 204 |
|
ep[0] += d2; |
| 205 |
|
ep[-hp->ns-1] += d2; |
| 206 |
|
} |
| 207 |
|
/* correct for number of neighbors */ |
| 208 |
< |
earr[0] *= 8./3.; |
| 209 |
< |
earr[hp->ns-1] *= 8./3.; |
| 210 |
< |
earr[(hp->ns-1)*hp->ns] *= 8./3.; |
| 211 |
< |
earr[(hp->ns-1)*hp->ns + hp->ns-1] *= 8./3.; |
| 208 |
> |
ep = earr + hp->ns*hp->ns; |
| 209 |
> |
ep[0] *= 6./3.; |
| 210 |
> |
ep[hp->ns-1] *= 6./3.; |
| 211 |
> |
ep[(hp->ns-1)*hp->ns] *= 6./3.; |
| 212 |
> |
ep[(hp->ns-1)*hp->ns + hp->ns-1] *= 6./3.; |
| 213 |
|
for (i = 1; i < hp->ns-1; i++) { |
| 214 |
< |
earr[i*hp->ns] *= 8./5.; |
| 215 |
< |
earr[i*hp->ns + hp->ns-1] *= 8./5.; |
| 214 |
> |
ep[i*hp->ns] *= 6./5.; |
| 215 |
> |
ep[i*hp->ns + hp->ns-1] *= 6./5.; |
| 216 |
|
} |
| 217 |
|
for (j = 1; j < hp->ns-1; j++) { |
| 218 |
< |
earr[j] *= 8./5.; |
| 219 |
< |
earr[(hp->ns-1)*hp->ns + j] *= 8./5.; |
| 218 |
> |
ep[j] *= 6./5.; |
| 219 |
> |
ep[(hp->ns-1)*hp->ns + j] *= 6./5.; |
| 220 |
|
} |
| 221 |
+ |
/* blur final map to reduce bias */ |
| 222 |
+ |
for (i = 0; i < hp->ns-1; i++) { |
| 223 |
+ |
float *ep2; |
| 224 |
+ |
ep = earr + i*hp->ns; |
| 225 |
+ |
ep2 = ep + hp->ns*hp->ns; |
| 226 |
+ |
for (j = 0; j < hp->ns-1; j++, ep++, ep2++) { |
| 227 |
+ |
ep[0] += .5*ep2[0] + .125*(ep2[1] + ep2[hp->ns]); |
| 228 |
+ |
ep[1] += .125*ep2[0]; |
| 229 |
+ |
ep[hp->ns] += .125*ep2[0]; |
| 230 |
+ |
} |
| 231 |
+ |
} |
| 232 |
|
return(earr); |
| 233 |
|
} |
| 234 |
|
|
| 264 |
|
|
| 265 |
|
static AMBHEMI * |
| 266 |
|
samp_hemi( /* sample indirect hemisphere */ |
| 267 |
< |
COLOR rcol, |
| 267 |
> |
SCOLOR rcol, |
| 268 |
|
RAY *r, |
| 269 |
|
double wt |
| 270 |
|
) |
| 271 |
|
{ |
| 272 |
+ |
int backside = (wt < 0); |
| 273 |
|
AMBHEMI *hp; |
| 274 |
|
double d; |
| 275 |
|
int n, i, j; |
| 276 |
|
/* insignificance check */ |
| 277 |
< |
if (bright(rcol) <= FTINY) |
| 277 |
> |
d = sintens(rcol); |
| 278 |
> |
if (d <= FTINY) |
| 279 |
|
return(NULL); |
| 280 |
|
/* set number of divisions */ |
| 281 |
+ |
if (backside) wt = -wt; |
| 282 |
|
if (ambacc <= FTINY && |
| 283 |
< |
wt > (d = 0.8*intens(rcol)*r->rweight/(ambdiv*minweight))) |
| 283 |
> |
wt > (d *= 0.8*r->rweight/(ambdiv*minweight + 1e-20))) |
| 284 |
|
wt = d; /* avoid ray termination */ |
| 285 |
|
n = sqrt(ambdiv * wt) + 0.5; |
| 286 |
< |
i = 1 + 5*(ambacc > FTINY); /* minimum number of samples */ |
| 287 |
< |
if (n < i) |
| 286 |
> |
i = 1 + (MINADIV-1)*(ambacc > FTINY); |
| 287 |
> |
if (n < i) /* use minimum number of samples? */ |
| 288 |
|
n = i; |
| 289 |
|
/* allocate sampling array */ |
| 290 |
|
hp = (AMBHEMI *)malloc(sizeof(AMBHEMI) + sizeof(AMBSAMP)*(n*n - 1)); |
| 291 |
|
if (hp == NULL) |
| 292 |
|
error(SYSTEM, "out of memory in samp_hemi"); |
| 293 |
+ |
|
| 294 |
+ |
if (backside) { |
| 295 |
+ |
hp->atyp = TAMBIENT; |
| 296 |
+ |
hp->onrm[0] = -r->ron[0]; |
| 297 |
+ |
hp->onrm[1] = -r->ron[1]; |
| 298 |
+ |
hp->onrm[2] = -r->ron[2]; |
| 299 |
+ |
} else { |
| 300 |
+ |
hp->atyp = RAMBIENT; |
| 301 |
+ |
VCOPY(hp->onrm, r->ron); |
| 302 |
+ |
} |
| 303 |
|
hp->rp = r; |
| 304 |
|
hp->ns = n; |
| 305 |
< |
hp->acol[RED] = hp->acol[GRN] = hp->acol[BLU] = 0.0; |
| 305 |
> |
scolorblack(hp->acol); |
| 306 |
|
memset(hp->sa, 0, sizeof(AMBSAMP)*n*n); |
| 307 |
|
hp->sampOK = 0; |
| 308 |
|
/* assign coefficient */ |
| 309 |
< |
copycolor(hp->acoef, rcol); |
| 309 |
> |
copyscolor(hp->acoef, rcol); |
| 310 |
|
d = 1.0/(n*n); |
| 311 |
< |
scalecolor(hp->acoef, d); |
| 311 |
> |
scalescolor(hp->acoef, d); |
| 312 |
|
/* make tangent plane axes */ |
| 313 |
< |
if (!getperpendicular(hp->ux, r->ron, 1)) |
| 313 |
> |
if (!getperpendicular(hp->ux, hp->onrm, 1)) |
| 314 |
|
error(CONSISTENCY, "bad ray direction in samp_hemi"); |
| 315 |
< |
VCROSS(hp->uy, r->ron, hp->ux); |
| 315 |
> |
VCROSS(hp->uy, hp->onrm, hp->ux); |
| 316 |
|
/* sample divisions */ |
| 317 |
|
for (i = hp->ns; i--; ) |
| 318 |
|
for (j = hp->ns; j--; ) |
| 319 |
|
hp->sampOK += ambsample(hp, i, j, 0); |
| 320 |
< |
copycolor(rcol, hp->acol); |
| 320 |
> |
copyscolor(rcol, hp->acol); |
| 321 |
|
if (!hp->sampOK) { /* utter failure? */ |
| 322 |
|
free(hp); |
| 323 |
|
return(NULL); |
| 326 |
|
hp->sampOK *= -1; /* soft failure */ |
| 327 |
|
return(hp); |
| 328 |
|
} |
| 329 |
+ |
if (hp->sampOK <= MINADIV*MINADIV) |
| 330 |
+ |
return(hp); /* don't bother super-sampling */ |
| 331 |
|
n = ambssamp*wt + 0.5; |
| 332 |
< |
if (n > 8) { /* perform super-sampling? */ |
| 332 |
> |
if (n >= 4*hp->ns) { /* perform super-sampling? */ |
| 333 |
|
ambsupersamp(hp, n); |
| 334 |
< |
copycolor(rcol, hp->acol); |
| 334 |
> |
copyscolor(rcol, hp->acol); |
| 335 |
|
} |
| 336 |
|
return(hp); /* all is well */ |
| 337 |
|
} |
| 343 |
|
{ |
| 344 |
|
if (hp->sa[n1].d <= hp->sa[n2].d) { |
| 345 |
|
if (hp->sa[n1].d <= hp->sa[n3].d) |
| 346 |
< |
return(colval(hp->sa[n1].v,CIEY)); |
| 347 |
< |
return(colval(hp->sa[n3].v,CIEY)); |
| 346 |
> |
return(hp->sa[n1].v[0]); |
| 347 |
> |
return(hp->sa[n3].v[0]); |
| 348 |
|
} |
| 349 |
|
if (hp->sa[n2].d <= hp->sa[n3].d) |
| 350 |
< |
return(colval(hp->sa[n2].v,CIEY)); |
| 351 |
< |
return(colval(hp->sa[n3].v,CIEY)); |
| 350 |
> |
return(hp->sa[n2].v[0]); |
| 351 |
> |
return(hp->sa[n3].v[0]); |
| 352 |
|
} |
| 353 |
|
|
| 354 |
|
|
| 577 |
|
for (j = 0; j < hp->ns-1; j++) { |
| 578 |
|
comp_fftri(&fftr, hp, AI(hp,0,j), AI(hp,0,j+1)); |
| 579 |
|
if (hessrow != NULL) |
| 580 |
< |
comp_hessian(hessrow[j], &fftr, hp->rp->ron); |
| 580 |
> |
comp_hessian(hessrow[j], &fftr, hp->onrm); |
| 581 |
|
if (gradrow != NULL) |
| 582 |
< |
comp_gradient(gradrow[j], &fftr, hp->rp->ron); |
| 582 |
> |
comp_gradient(gradrow[j], &fftr, hp->onrm); |
| 583 |
|
} |
| 584 |
|
/* sum each row of triangles */ |
| 585 |
|
for (i = 0; i < hp->ns-1; i++) { |
| 587 |
|
FVECT gradcol; |
| 588 |
|
comp_fftri(&fftr, hp, AI(hp,i,0), AI(hp,i+1,0)); |
| 589 |
|
if (hessrow != NULL) |
| 590 |
< |
comp_hessian(hesscol, &fftr, hp->rp->ron); |
| 590 |
> |
comp_hessian(hesscol, &fftr, hp->onrm); |
| 591 |
|
if (gradrow != NULL) |
| 592 |
< |
comp_gradient(gradcol, &fftr, hp->rp->ron); |
| 592 |
> |
comp_gradient(gradcol, &fftr, hp->onrm); |
| 593 |
|
for (j = 0; j < hp->ns-1; j++) { |
| 594 |
|
FVECT hessdia[3]; /* compute triangle contributions */ |
| 595 |
|
FVECT graddia; |
| 599 |
|
/* diagonal (inner) edge */ |
| 600 |
|
comp_fftri(&fftr, hp, AI(hp,i,j+1), AI(hp,i+1,j)); |
| 601 |
|
if (hessrow != NULL) { |
| 602 |
< |
comp_hessian(hessdia, &fftr, hp->rp->ron); |
| 602 |
> |
comp_hessian(hessdia, &fftr, hp->onrm); |
| 603 |
|
rev_hessian(hesscol); |
| 604 |
|
add2hessian(hessian, hessrow[j], hessdia, hesscol, backg); |
| 605 |
|
} |
| 606 |
|
if (gradrow != NULL) { |
| 607 |
< |
comp_gradient(graddia, &fftr, hp->rp->ron); |
| 607 |
> |
comp_gradient(graddia, &fftr, hp->onrm); |
| 608 |
|
rev_gradient(gradcol); |
| 609 |
|
add2gradient(gradient, gradrow[j], graddia, gradcol, backg); |
| 610 |
|
} |
| 611 |
|
/* initialize edge in next row */ |
| 612 |
|
comp_fftri(&fftr, hp, AI(hp,i+1,j+1), AI(hp,i+1,j)); |
| 613 |
|
if (hessrow != NULL) |
| 614 |
< |
comp_hessian(hessrow[j], &fftr, hp->rp->ron); |
| 614 |
> |
comp_hessian(hessrow[j], &fftr, hp->onrm); |
| 615 |
|
if (gradrow != NULL) |
| 616 |
< |
comp_gradient(gradrow[j], &fftr, hp->rp->ron); |
| 616 |
> |
comp_gradient(gradrow[j], &fftr, hp->onrm); |
| 617 |
|
/* new column edge & paired triangle */ |
| 618 |
|
backg = back_ambval(hp, AI(hp,i+1,j+1), |
| 619 |
|
AI(hp,i+1,j), AI(hp,i,j+1)); |
| 620 |
|
comp_fftri(&fftr, hp, AI(hp,i,j+1), AI(hp,i+1,j+1)); |
| 621 |
|
if (hessrow != NULL) { |
| 622 |
< |
comp_hessian(hesscol, &fftr, hp->rp->ron); |
| 622 |
> |
comp_hessian(hesscol, &fftr, hp->onrm); |
| 623 |
|
rev_hessian(hessdia); |
| 624 |
|
add2hessian(hessian, hessrow[j], hessdia, hesscol, backg); |
| 625 |
|
if (i < hp->ns-2) |
| 626 |
|
rev_hessian(hessrow[j]); |
| 627 |
|
} |
| 628 |
|
if (gradrow != NULL) { |
| 629 |
< |
comp_gradient(gradcol, &fftr, hp->rp->ron); |
| 629 |
> |
comp_gradient(gradcol, &fftr, hp->onrm); |
| 630 |
|
rev_gradient(graddia); |
| 631 |
|
add2gradient(gradient, gradrow[j], graddia, gradcol, backg); |
| 632 |
|
if (i < hp->ns-2) |
| 662 |
|
/* use vector for azimuth + 90deg */ |
| 663 |
|
VSUB(vd, ap->p, hp->rp->rop); |
| 664 |
|
/* brightness over cosine factor */ |
| 665 |
< |
gfact = colval(ap->v,CIEY) / DOT(hp->rp->ron, vd); |
| 665 |
> |
gfact = ap->v[0] / DOT(hp->onrm, vd); |
| 666 |
|
/* sine = proj_radius/vd_length */ |
| 667 |
|
dgsum[0] -= DOT(uv[1], vd) * gfact; |
| 668 |
|
dgsum[1] += DOT(uv[0], vd) * gfact; |
| 718 |
|
|
| 719 |
|
int |
| 720 |
|
doambient( /* compute ambient component */ |
| 721 |
< |
COLOR rcol, /* input/output color */ |
| 721 |
> |
SCOLOR rcol, /* input/output color */ |
| 722 |
|
RAY *r, |
| 723 |
< |
double wt, |
| 723 |
> |
double wt, /* negative for back side */ |
| 724 |
|
FVECT uv[2], /* returned (optional) */ |
| 725 |
|
float ra[2], /* returned (optional) */ |
| 726 |
|
float pg[2], /* returned (optional) */ |
| 748 |
|
return(0); |
| 749 |
|
|
| 750 |
|
if ((ra == NULL) & (pg == NULL) & (dg == NULL) || |
| 751 |
< |
(hp->sampOK < 0) | (hp->ns < 6)) { |
| 751 |
> |
(hp->sampOK < 0) | (hp->ns < MINADIV)) { |
| 752 |
|
free(hp); /* Hessian not requested/possible */ |
| 753 |
|
return(-1); /* value-only return value */ |
| 754 |
|
} |
| 755 |
< |
if ((d = bright(rcol)) > FTINY) { /* normalize Y values */ |
| 756 |
< |
d = 0.99*(hp->ns*hp->ns)/d; |
| 755 |
> |
if ((d = scolor_mean(rcol)) > FTINY) { |
| 756 |
> |
d = 0.99*(hp->ns*hp->ns)/d; /* normalize avg. values */ |
| 757 |
|
K = 0.01; |
| 758 |
|
} else { /* or fall back on geometric Hessian */ |
| 759 |
|
K = 1.0; |
| 761 |
|
dg = NULL; |
| 762 |
|
crlp = NULL; |
| 763 |
|
} |
| 764 |
< |
ap = hp->sa; /* relative Y channel from here on... */ |
| 764 |
> |
ap = hp->sa; /* single channel from here on... */ |
| 765 |
|
for (i = hp->ns*hp->ns; i--; ap++) |
| 766 |
< |
colval(ap->v,CIEY) = bright(ap->v)*d + K; |
| 766 |
> |
ap->v[0] = scolor_mean(ap->v)*d + K; |
| 767 |
|
|
| 768 |
|
if (uv == NULL) /* make sure we have axis pointers */ |
| 769 |
|
uv = my_uv; |
| 787 |
|
if (ra[1] < minarad) |
| 788 |
|
ra[1] = minarad; |
| 789 |
|
} |
| 790 |
< |
ra[0] *= d = 1.0/sqrt(wt); |
| 790 |
> |
ra[0] *= d = 1.0/sqrt(fabs(wt)); |
| 791 |
|
if ((ra[1] *= d) > 2.0*ra[0]) |
| 792 |
|
ra[1] = 2.0*ra[0]; |
| 793 |
|
if (ra[1] > maxarad) { |
| 796 |
|
ra[0] = maxarad; |
| 797 |
|
} |
| 798 |
|
/* flag encroached directions */ |
| 799 |
< |
if (crlp != NULL) |
| 799 |
> |
if (crlp != NULL) /* XXX doesn't update with changes to ambacc */ |
| 800 |
|
*crlp = ambcorral(hp, uv, ra[0]*ambacc, ra[1]*ambacc); |
| 801 |
|
if (pg != NULL) { /* cap gradient if necessary */ |
| 802 |
|
d = pg[0]*pg[0]*ra[0]*ra[0] + pg[1]*pg[1]*ra[1]*ra[1]; |
| 810 |
|
free(hp); /* clean up and return */ |
| 811 |
|
return(1); |
| 812 |
|
} |
| 778 |
– |
|
| 779 |
– |
|
| 780 |
– |
#else /* ! NEWAMB */ |
| 781 |
– |
|
| 782 |
– |
|
| 783 |
– |
void |
| 784 |
– |
inithemi( /* initialize sampling hemisphere */ |
| 785 |
– |
AMBHEMI *hp, |
| 786 |
– |
COLOR ac, |
| 787 |
– |
RAY *r, |
| 788 |
– |
double wt |
| 789 |
– |
) |
| 790 |
– |
{ |
| 791 |
– |
double d; |
| 792 |
– |
int i; |
| 793 |
– |
/* set number of divisions */ |
| 794 |
– |
if (ambacc <= FTINY && |
| 795 |
– |
wt > (d = 0.8*intens(ac)*r->rweight/(ambdiv*minweight))) |
| 796 |
– |
wt = d; /* avoid ray termination */ |
| 797 |
– |
hp->nt = sqrt(ambdiv * wt / PI) + 0.5; |
| 798 |
– |
i = ambacc > FTINY ? 3 : 1; /* minimum number of samples */ |
| 799 |
– |
if (hp->nt < i) |
| 800 |
– |
hp->nt = i; |
| 801 |
– |
hp->np = PI * hp->nt + 0.5; |
| 802 |
– |
/* set number of super-samples */ |
| 803 |
– |
hp->ns = ambssamp * wt + 0.5; |
| 804 |
– |
/* assign coefficient */ |
| 805 |
– |
copycolor(hp->acoef, ac); |
| 806 |
– |
d = 1.0/(hp->nt*hp->np); |
| 807 |
– |
scalecolor(hp->acoef, d); |
| 808 |
– |
/* make axes */ |
| 809 |
– |
VCOPY(hp->uz, r->ron); |
| 810 |
– |
hp->uy[0] = hp->uy[1] = hp->uy[2] = 0.0; |
| 811 |
– |
for (i = 0; i < 3; i++) |
| 812 |
– |
if (hp->uz[i] < 0.6 && hp->uz[i] > -0.6) |
| 813 |
– |
break; |
| 814 |
– |
if (i >= 3) |
| 815 |
– |
error(CONSISTENCY, "bad ray direction in inithemi"); |
| 816 |
– |
hp->uy[i] = 1.0; |
| 817 |
– |
fcross(hp->ux, hp->uy, hp->uz); |
| 818 |
– |
normalize(hp->ux); |
| 819 |
– |
fcross(hp->uy, hp->uz, hp->ux); |
| 820 |
– |
} |
| 821 |
– |
|
| 822 |
– |
|
| 823 |
– |
int |
| 824 |
– |
divsample( /* sample a division */ |
| 825 |
– |
AMBSAMP *dp, |
| 826 |
– |
AMBHEMI *h, |
| 827 |
– |
RAY *r |
| 828 |
– |
) |
| 829 |
– |
{ |
| 830 |
– |
RAY ar; |
| 831 |
– |
int hlist[3]; |
| 832 |
– |
double spt[2]; |
| 833 |
– |
double xd, yd, zd; |
| 834 |
– |
double b2; |
| 835 |
– |
double phi; |
| 836 |
– |
int i; |
| 837 |
– |
/* ambient coefficient for weight */ |
| 838 |
– |
if (ambacc > FTINY) |
| 839 |
– |
setcolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL); |
| 840 |
– |
else |
| 841 |
– |
copycolor(ar.rcoef, h->acoef); |
| 842 |
– |
if (rayorigin(&ar, AMBIENT, r, ar.rcoef) < 0) |
| 843 |
– |
return(-1); |
| 844 |
– |
if (ambacc > FTINY) { |
| 845 |
– |
multcolor(ar.rcoef, h->acoef); |
| 846 |
– |
scalecolor(ar.rcoef, 1./AVGREFL); |
| 847 |
– |
} |
| 848 |
– |
hlist[0] = r->rno; |
| 849 |
– |
hlist[1] = dp->t; |
| 850 |
– |
hlist[2] = dp->p; |
| 851 |
– |
multisamp(spt, 2, urand(ilhash(hlist,3)+dp->n)); |
| 852 |
– |
zd = sqrt((dp->t + spt[0])/h->nt); |
| 853 |
– |
phi = 2.0*PI * (dp->p + spt[1])/h->np; |
| 854 |
– |
xd = tcos(phi) * zd; |
| 855 |
– |
yd = tsin(phi) * zd; |
| 856 |
– |
zd = sqrt(1.0 - zd*zd); |
| 857 |
– |
for (i = 0; i < 3; i++) |
| 858 |
– |
ar.rdir[i] = xd*h->ux[i] + |
| 859 |
– |
yd*h->uy[i] + |
| 860 |
– |
zd*h->uz[i]; |
| 861 |
– |
checknorm(ar.rdir); |
| 862 |
– |
dimlist[ndims++] = dp->t*h->np + dp->p + 90171; |
| 863 |
– |
rayvalue(&ar); |
| 864 |
– |
ndims--; |
| 865 |
– |
multcolor(ar.rcol, ar.rcoef); /* apply coefficient */ |
| 866 |
– |
addcolor(dp->v, ar.rcol); |
| 867 |
– |
/* use rxt to improve gradient calc */ |
| 868 |
– |
if (ar.rxt > FTINY && ar.rxt < FHUGE) |
| 869 |
– |
dp->r += 1.0/ar.rxt; |
| 870 |
– |
/* (re)initialize error */ |
| 871 |
– |
if (dp->n++) { |
| 872 |
– |
b2 = bright(dp->v)/dp->n - bright(ar.rcol); |
| 873 |
– |
b2 = b2*b2 + dp->k*((dp->n-1)*(dp->n-1)); |
| 874 |
– |
dp->k = b2/(dp->n*dp->n); |
| 875 |
– |
} else |
| 876 |
– |
dp->k = 0.0; |
| 877 |
– |
return(0); |
| 878 |
– |
} |
| 879 |
– |
|
| 880 |
– |
|
| 881 |
– |
static int |
| 882 |
– |
ambcmp( /* decreasing order */ |
| 883 |
– |
const void *p1, |
| 884 |
– |
const void *p2 |
| 885 |
– |
) |
| 886 |
– |
{ |
| 887 |
– |
const AMBSAMP *d1 = (const AMBSAMP *)p1; |
| 888 |
– |
const AMBSAMP *d2 = (const AMBSAMP *)p2; |
| 889 |
– |
|
| 890 |
– |
if (d1->k < d2->k) |
| 891 |
– |
return(1); |
| 892 |
– |
if (d1->k > d2->k) |
| 893 |
– |
return(-1); |
| 894 |
– |
return(0); |
| 895 |
– |
} |
| 896 |
– |
|
| 897 |
– |
|
| 898 |
– |
static int |
| 899 |
– |
ambnorm( /* standard order */ |
| 900 |
– |
const void *p1, |
| 901 |
– |
const void *p2 |
| 902 |
– |
) |
| 903 |
– |
{ |
| 904 |
– |
const AMBSAMP *d1 = (const AMBSAMP *)p1; |
| 905 |
– |
const AMBSAMP *d2 = (const AMBSAMP *)p2; |
| 906 |
– |
int c; |
| 907 |
– |
|
| 908 |
– |
if ( (c = d1->t - d2->t) ) |
| 909 |
– |
return(c); |
| 910 |
– |
return(d1->p - d2->p); |
| 911 |
– |
} |
| 912 |
– |
|
| 913 |
– |
|
| 914 |
– |
double |
| 915 |
– |
doambient( /* compute ambient component */ |
| 916 |
– |
COLOR rcol, |
| 917 |
– |
RAY *r, |
| 918 |
– |
double wt, |
| 919 |
– |
FVECT pg, |
| 920 |
– |
FVECT dg |
| 921 |
– |
) |
| 922 |
– |
{ |
| 923 |
– |
double b, d=0; |
| 924 |
– |
AMBHEMI hemi; |
| 925 |
– |
AMBSAMP *div; |
| 926 |
– |
AMBSAMP dnew; |
| 927 |
– |
double acol[3]; |
| 928 |
– |
AMBSAMP *dp; |
| 929 |
– |
double arad; |
| 930 |
– |
int divcnt; |
| 931 |
– |
int i, j; |
| 932 |
– |
/* initialize hemisphere */ |
| 933 |
– |
inithemi(&hemi, rcol, r, wt); |
| 934 |
– |
divcnt = hemi.nt * hemi.np; |
| 935 |
– |
/* initialize */ |
| 936 |
– |
if (pg != NULL) |
| 937 |
– |
pg[0] = pg[1] = pg[2] = 0.0; |
| 938 |
– |
if (dg != NULL) |
| 939 |
– |
dg[0] = dg[1] = dg[2] = 0.0; |
| 940 |
– |
setcolor(rcol, 0.0, 0.0, 0.0); |
| 941 |
– |
if (divcnt == 0) |
| 942 |
– |
return(0.0); |
| 943 |
– |
/* allocate super-samples */ |
| 944 |
– |
if (hemi.ns > 0 || pg != NULL || dg != NULL) { |
| 945 |
– |
div = (AMBSAMP *)malloc(divcnt*sizeof(AMBSAMP)); |
| 946 |
– |
if (div == NULL) |
| 947 |
– |
error(SYSTEM, "out of memory in doambient"); |
| 948 |
– |
} else |
| 949 |
– |
div = NULL; |
| 950 |
– |
/* sample the divisions */ |
| 951 |
– |
arad = 0.0; |
| 952 |
– |
acol[0] = acol[1] = acol[2] = 0.0; |
| 953 |
– |
if ((dp = div) == NULL) |
| 954 |
– |
dp = &dnew; |
| 955 |
– |
divcnt = 0; |
| 956 |
– |
for (i = 0; i < hemi.nt; i++) |
| 957 |
– |
for (j = 0; j < hemi.np; j++) { |
| 958 |
– |
dp->t = i; dp->p = j; |
| 959 |
– |
setcolor(dp->v, 0.0, 0.0, 0.0); |
| 960 |
– |
dp->r = 0.0; |
| 961 |
– |
dp->n = 0; |
| 962 |
– |
if (divsample(dp, &hemi, r) < 0) { |
| 963 |
– |
if (div != NULL) |
| 964 |
– |
dp++; |
| 965 |
– |
continue; |
| 966 |
– |
} |
| 967 |
– |
arad += dp->r; |
| 968 |
– |
divcnt++; |
| 969 |
– |
if (div != NULL) |
| 970 |
– |
dp++; |
| 971 |
– |
else |
| 972 |
– |
addcolor(acol, dp->v); |
| 973 |
– |
} |
| 974 |
– |
if (!divcnt) { |
| 975 |
– |
if (div != NULL) |
| 976 |
– |
free((void *)div); |
| 977 |
– |
return(0.0); /* no samples taken */ |
| 978 |
– |
} |
| 979 |
– |
if (divcnt < hemi.nt*hemi.np) { |
| 980 |
– |
pg = dg = NULL; /* incomplete sampling */ |
| 981 |
– |
hemi.ns = 0; |
| 982 |
– |
} else if (arad > FTINY && divcnt/arad < minarad) { |
| 983 |
– |
hemi.ns = 0; /* close enough */ |
| 984 |
– |
} else if (hemi.ns > 0) { /* else perform super-sampling? */ |
| 985 |
– |
comperrs(div, &hemi); /* compute errors */ |
| 986 |
– |
qsort(div, divcnt, sizeof(AMBSAMP), ambcmp); /* sort divs */ |
| 987 |
– |
/* super-sample */ |
| 988 |
– |
for (i = hemi.ns; i > 0; i--) { |
| 989 |
– |
dnew = *div; |
| 990 |
– |
if (divsample(&dnew, &hemi, r) < 0) { |
| 991 |
– |
dp++; |
| 992 |
– |
continue; |
| 993 |
– |
} |
| 994 |
– |
dp = div; /* reinsert */ |
| 995 |
– |
j = divcnt < i ? divcnt : i; |
| 996 |
– |
while (--j > 0 && dnew.k < dp[1].k) { |
| 997 |
– |
*dp = *(dp+1); |
| 998 |
– |
dp++; |
| 999 |
– |
} |
| 1000 |
– |
*dp = dnew; |
| 1001 |
– |
} |
| 1002 |
– |
if (pg != NULL || dg != NULL) /* restore order */ |
| 1003 |
– |
qsort(div, divcnt, sizeof(AMBSAMP), ambnorm); |
| 1004 |
– |
} |
| 1005 |
– |
/* compute returned values */ |
| 1006 |
– |
if (div != NULL) { |
| 1007 |
– |
arad = 0.0; /* note: divcnt may be < nt*np */ |
| 1008 |
– |
for (i = hemi.nt*hemi.np, dp = div; i-- > 0; dp++) { |
| 1009 |
– |
arad += dp->r; |
| 1010 |
– |
if (dp->n > 1) { |
| 1011 |
– |
b = 1.0/dp->n; |
| 1012 |
– |
scalecolor(dp->v, b); |
| 1013 |
– |
dp->r *= b; |
| 1014 |
– |
dp->n = 1; |
| 1015 |
– |
} |
| 1016 |
– |
addcolor(acol, dp->v); |
| 1017 |
– |
} |
| 1018 |
– |
b = bright(acol); |
| 1019 |
– |
if (b > FTINY) { |
| 1020 |
– |
b = 1.0/b; /* compute & normalize gradient(s) */ |
| 1021 |
– |
if (pg != NULL) { |
| 1022 |
– |
posgradient(pg, div, &hemi); |
| 1023 |
– |
for (i = 0; i < 3; i++) |
| 1024 |
– |
pg[i] *= b; |
| 1025 |
– |
} |
| 1026 |
– |
if (dg != NULL) { |
| 1027 |
– |
dirgradient(dg, div, &hemi); |
| 1028 |
– |
for (i = 0; i < 3; i++) |
| 1029 |
– |
dg[i] *= b; |
| 1030 |
– |
} |
| 1031 |
– |
} |
| 1032 |
– |
free((void *)div); |
| 1033 |
– |
} |
| 1034 |
– |
copycolor(rcol, acol); |
| 1035 |
– |
if (arad <= FTINY) |
| 1036 |
– |
arad = maxarad; |
| 1037 |
– |
else |
| 1038 |
– |
arad = (divcnt+hemi.ns)/arad; |
| 1039 |
– |
if (pg != NULL) { /* reduce radius if gradient large */ |
| 1040 |
– |
d = DOT(pg,pg); |
| 1041 |
– |
if (d*arad*arad > 1.0) |
| 1042 |
– |
arad = 1.0/sqrt(d); |
| 1043 |
– |
} |
| 1044 |
– |
if (arad < minarad) { |
| 1045 |
– |
arad = minarad; |
| 1046 |
– |
if (pg != NULL && d*arad*arad > 1.0) { /* cap gradient */ |
| 1047 |
– |
d = 1.0/arad/sqrt(d); |
| 1048 |
– |
for (i = 0; i < 3; i++) |
| 1049 |
– |
pg[i] *= d; |
| 1050 |
– |
} |
| 1051 |
– |
} |
| 1052 |
– |
if ((arad /= sqrt(wt)) > maxarad) |
| 1053 |
– |
arad = maxarad; |
| 1054 |
– |
return(arad); |
| 1055 |
– |
} |
| 1056 |
– |
|
| 1057 |
– |
|
| 1058 |
– |
void |
| 1059 |
– |
comperrs( /* compute initial error estimates */ |
| 1060 |
– |
AMBSAMP *da, /* assumes standard ordering */ |
| 1061 |
– |
AMBHEMI *hp |
| 1062 |
– |
) |
| 1063 |
– |
{ |
| 1064 |
– |
double b, b2; |
| 1065 |
– |
int i, j; |
| 1066 |
– |
AMBSAMP *dp; |
| 1067 |
– |
/* sum differences from neighbors */ |
| 1068 |
– |
dp = da; |
| 1069 |
– |
for (i = 0; i < hp->nt; i++) |
| 1070 |
– |
for (j = 0; j < hp->np; j++) { |
| 1071 |
– |
#ifdef DEBUG |
| 1072 |
– |
if (dp->t != i || dp->p != j) |
| 1073 |
– |
error(CONSISTENCY, |
| 1074 |
– |
"division order in comperrs"); |
| 1075 |
– |
#endif |
| 1076 |
– |
b = bright(dp[0].v); |
| 1077 |
– |
if (i > 0) { /* from above */ |
| 1078 |
– |
b2 = bright(dp[-hp->np].v) - b; |
| 1079 |
– |
b2 *= b2 * 0.25; |
| 1080 |
– |
dp[0].k += b2; |
| 1081 |
– |
dp[-hp->np].k += b2; |
| 1082 |
– |
} |
| 1083 |
– |
if (j > 0) { /* from behind */ |
| 1084 |
– |
b2 = bright(dp[-1].v) - b; |
| 1085 |
– |
b2 *= b2 * 0.25; |
| 1086 |
– |
dp[0].k += b2; |
| 1087 |
– |
dp[-1].k += b2; |
| 1088 |
– |
} else { /* around */ |
| 1089 |
– |
b2 = bright(dp[hp->np-1].v) - b; |
| 1090 |
– |
b2 *= b2 * 0.25; |
| 1091 |
– |
dp[0].k += b2; |
| 1092 |
– |
dp[hp->np-1].k += b2; |
| 1093 |
– |
} |
| 1094 |
– |
dp++; |
| 1095 |
– |
} |
| 1096 |
– |
/* divide by number of neighbors */ |
| 1097 |
– |
dp = da; |
| 1098 |
– |
for (j = 0; j < hp->np; j++) /* top row */ |
| 1099 |
– |
(dp++)->k *= 1.0/3.0; |
| 1100 |
– |
if (hp->nt < 2) |
| 1101 |
– |
return; |
| 1102 |
– |
for (i = 1; i < hp->nt-1; i++) /* central region */ |
| 1103 |
– |
for (j = 0; j < hp->np; j++) |
| 1104 |
– |
(dp++)->k *= 0.25; |
| 1105 |
– |
for (j = 0; j < hp->np; j++) /* bottom row */ |
| 1106 |
– |
(dp++)->k *= 1.0/3.0; |
| 1107 |
– |
} |
| 1108 |
– |
|
| 1109 |
– |
|
| 1110 |
– |
void |
| 1111 |
– |
posgradient( /* compute position gradient */ |
| 1112 |
– |
FVECT gv, |
| 1113 |
– |
AMBSAMP *da, /* assumes standard ordering */ |
| 1114 |
– |
AMBHEMI *hp |
| 1115 |
– |
) |
| 1116 |
– |
{ |
| 1117 |
– |
int i, j; |
| 1118 |
– |
double nextsine, lastsine, b, d; |
| 1119 |
– |
double mag0, mag1; |
| 1120 |
– |
double phi, cosp, sinp, xd, yd; |
| 1121 |
– |
AMBSAMP *dp; |
| 1122 |
– |
|
| 1123 |
– |
xd = yd = 0.0; |
| 1124 |
– |
for (j = 0; j < hp->np; j++) { |
| 1125 |
– |
dp = da + j; |
| 1126 |
– |
mag0 = mag1 = 0.0; |
| 1127 |
– |
lastsine = 0.0; |
| 1128 |
– |
for (i = 0; i < hp->nt; i++) { |
| 1129 |
– |
#ifdef DEBUG |
| 1130 |
– |
if (dp->t != i || dp->p != j) |
| 1131 |
– |
error(CONSISTENCY, |
| 1132 |
– |
"division order in posgradient"); |
| 1133 |
– |
#endif |
| 1134 |
– |
b = bright(dp->v); |
| 1135 |
– |
if (i > 0) { |
| 1136 |
– |
d = dp[-hp->np].r; |
| 1137 |
– |
if (dp[0].r > d) d = dp[0].r; |
| 1138 |
– |
/* sin(t)*cos(t)^2 */ |
| 1139 |
– |
d *= lastsine * (1.0 - (double)i/hp->nt); |
| 1140 |
– |
mag0 += d*(b - bright(dp[-hp->np].v)); |
| 1141 |
– |
} |
| 1142 |
– |
nextsine = sqrt((double)(i+1)/hp->nt); |
| 1143 |
– |
if (j > 0) { |
| 1144 |
– |
d = dp[-1].r; |
| 1145 |
– |
if (dp[0].r > d) d = dp[0].r; |
| 1146 |
– |
mag1 += d * (nextsine - lastsine) * |
| 1147 |
– |
(b - bright(dp[-1].v)); |
| 1148 |
– |
} else { |
| 1149 |
– |
d = dp[hp->np-1].r; |
| 1150 |
– |
if (dp[0].r > d) d = dp[0].r; |
| 1151 |
– |
mag1 += d * (nextsine - lastsine) * |
| 1152 |
– |
(b - bright(dp[hp->np-1].v)); |
| 1153 |
– |
} |
| 1154 |
– |
dp += hp->np; |
| 1155 |
– |
lastsine = nextsine; |
| 1156 |
– |
} |
| 1157 |
– |
mag0 *= 2.0*PI / hp->np; |
| 1158 |
– |
phi = 2.0*PI * (double)j/hp->np; |
| 1159 |
– |
cosp = tcos(phi); sinp = tsin(phi); |
| 1160 |
– |
xd += mag0*cosp - mag1*sinp; |
| 1161 |
– |
yd += mag0*sinp + mag1*cosp; |
| 1162 |
– |
} |
| 1163 |
– |
for (i = 0; i < 3; i++) |
| 1164 |
– |
gv[i] = (xd*hp->ux[i] + yd*hp->uy[i])*(hp->nt*hp->np)/PI; |
| 1165 |
– |
} |
| 1166 |
– |
|
| 1167 |
– |
|
| 1168 |
– |
void |
| 1169 |
– |
dirgradient( /* compute direction gradient */ |
| 1170 |
– |
FVECT gv, |
| 1171 |
– |
AMBSAMP *da, /* assumes standard ordering */ |
| 1172 |
– |
AMBHEMI *hp |
| 1173 |
– |
) |
| 1174 |
– |
{ |
| 1175 |
– |
int i, j; |
| 1176 |
– |
double mag; |
| 1177 |
– |
double phi, xd, yd; |
| 1178 |
– |
AMBSAMP *dp; |
| 1179 |
– |
|
| 1180 |
– |
xd = yd = 0.0; |
| 1181 |
– |
for (j = 0; j < hp->np; j++) { |
| 1182 |
– |
dp = da + j; |
| 1183 |
– |
mag = 0.0; |
| 1184 |
– |
for (i = 0; i < hp->nt; i++) { |
| 1185 |
– |
#ifdef DEBUG |
| 1186 |
– |
if (dp->t != i || dp->p != j) |
| 1187 |
– |
error(CONSISTENCY, |
| 1188 |
– |
"division order in dirgradient"); |
| 1189 |
– |
#endif |
| 1190 |
– |
/* tan(t) */ |
| 1191 |
– |
mag += bright(dp->v)/sqrt(hp->nt/(i+.5) - 1.0); |
| 1192 |
– |
dp += hp->np; |
| 1193 |
– |
} |
| 1194 |
– |
phi = 2.0*PI * (j+.5)/hp->np + PI/2.0; |
| 1195 |
– |
xd += mag * tcos(phi); |
| 1196 |
– |
yd += mag * tsin(phi); |
| 1197 |
– |
} |
| 1198 |
– |
for (i = 0; i < 3; i++) |
| 1199 |
– |
gv[i] = xd*hp->ux[i] + yd*hp->uy[i]; |
| 1200 |
– |
} |
| 1201 |
– |
|
| 1202 |
– |
#endif /* ! NEWAMB */ |
