100 |
|
AMBSAMP *ap = &ambsam(hp,i,j); |
101 |
|
RAY ar; |
102 |
|
int hlist[3], ii; |
103 |
+ |
double ss[2]; |
104 |
|
RREAL spt[2]; |
105 |
|
double zd; |
106 |
|
/* generate hemispherical sample */ |
116 |
|
scalescolor(ar.rcoef, 1./AVGREFL); |
117 |
|
} |
118 |
|
hlist[0] = hp->rp->rno; |
119 |
< |
hlist[1] = j; |
120 |
< |
hlist[2] = i; |
121 |
< |
multisamp(spt, 2, urand(ilhash(hlist,3)+n)); |
119 |
> |
hlist[1] = AI(hp,i,j); |
120 |
> |
hlist[2] = samplendx; |
121 |
> |
multisamp(ss, 2, urand(ilhash(hlist,3)+n)); |
122 |
|
resample: |
123 |
< |
square2disk(spt, (j+spt[1])/hp->ns, (i+spt[0])/hp->ns); |
123 |
> |
square2disk(spt, (j+ss[1])/hp->ns, (i+ss[0])/hp->ns); |
124 |
|
zd = sqrt(1. - spt[0]*spt[0] - spt[1]*spt[1]); |
125 |
|
for (ii = 3; ii--; ) |
126 |
|
ar.rdir[ii] = spt[0]*hp->ux[ii] + |
128 |
|
zd*hp->onrm[ii]; |
129 |
|
checknorm(ar.rdir); |
130 |
|
/* avoid coincident samples */ |
131 |
< |
if (!n && ambcollision(hp, i, j, ar.rdir)) { |
132 |
< |
spt[0] = frandom(); spt[1] = frandom(); |
131 |
> |
if (!n && hp->ns >= 4 && ambcollision(hp, i, j, ar.rdir)) { |
132 |
> |
ss[0] = frandom(); ss[1] = frandom(); |
133 |
|
goto resample; /* reject this sample */ |
134 |
|
} |
135 |
|
dimlist[ndims++] = AI(hp,i,j) + 90171; |
164 |
|
getambdiffs(AMBHEMI *hp) |
165 |
|
{ |
166 |
|
const double normf = 1./(pbright(hp->acoef) + FTINY); |
167 |
< |
float *earr = (float *)calloc(hp->ns*hp->ns, sizeof(float)); |
168 |
< |
float *ep, *earr2; |
167 |
> |
float *earr = (float *)calloc(2*hp->ns*hp->ns, sizeof(float)); |
168 |
> |
float *ep; |
169 |
|
AMBSAMP *ap; |
170 |
|
double b, b1, d2; |
171 |
|
int i, j; |
173 |
|
if (earr == NULL) /* out of memory? */ |
174 |
|
return(NULL); |
175 |
|
/* sum squared neighbor diffs */ |
176 |
< |
for (ap = hp->sa, ep = earr, i = 0; i < hp->ns; i++) |
176 |
> |
ap = hp->sa; |
177 |
> |
ep = earr + hp->ns*hp->ns; /* original estimates to scratch */ |
178 |
> |
for (i = 0; i < hp->ns; i++) |
179 |
|
for (j = 0; j < hp->ns; j++, ap++, ep++) { |
180 |
|
b = pbright(ap[0].v); |
181 |
|
if (i) { /* from above */ |
201 |
|
ep[-hp->ns-1] += d2; |
202 |
|
} |
203 |
|
/* correct for number of neighbors */ |
204 |
< |
earr[0] *= 6./3.; |
205 |
< |
earr[hp->ns-1] *= 6./3.; |
206 |
< |
earr[(hp->ns-1)*hp->ns] *= 6./3.; |
207 |
< |
earr[(hp->ns-1)*hp->ns + hp->ns-1] *= 6./3.; |
204 |
> |
ep = earr + hp->ns*hp->ns; |
205 |
> |
ep[0] *= 6./3.; |
206 |
> |
ep[hp->ns-1] *= 6./3.; |
207 |
> |
ep[(hp->ns-1)*hp->ns] *= 6./3.; |
208 |
> |
ep[(hp->ns-1)*hp->ns + hp->ns-1] *= 6./3.; |
209 |
|
for (i = 1; i < hp->ns-1; i++) { |
210 |
< |
earr[i*hp->ns] *= 6./5.; |
211 |
< |
earr[i*hp->ns + hp->ns-1] *= 6./5.; |
210 |
> |
ep[i*hp->ns] *= 6./5.; |
211 |
> |
ep[i*hp->ns + hp->ns-1] *= 6./5.; |
212 |
|
} |
213 |
|
for (j = 1; j < hp->ns-1; j++) { |
214 |
< |
earr[j] *= 6./5.; |
215 |
< |
earr[(hp->ns-1)*hp->ns + j] *= 6./5.; |
214 |
> |
ep[j] *= 6./5.; |
215 |
> |
ep[(hp->ns-1)*hp->ns + j] *= 6./5.; |
216 |
|
} |
217 |
< |
/* preen map to avoid cliffs */ |
214 |
< |
earr2 = (float *)malloc(hp->ns*hp->ns*sizeof(float)); |
215 |
< |
if (earr2 == NULL) |
216 |
< |
return(earr); |
217 |
< |
memcpy(earr2, earr, hp->ns*hp->ns*sizeof(float)); |
217 |
> |
/* blur final map to reduce bias */ |
218 |
|
for (i = 0; i < hp->ns-1; i++) { |
219 |
< |
float *ep2 = earr2 + i*hp->ns; |
219 |
> |
float *ep2; |
220 |
|
ep = earr + i*hp->ns; |
221 |
< |
for (j = 0; j < hp->ns-1; j++, ep2++, ep++) { |
222 |
< |
if (ep2[1] < .5*ep2[0]) { |
223 |
< |
ep[0] -= .125*ep2[0]; |
224 |
< |
ep[1] += .125*ep2[0]; |
225 |
< |
} else if (ep2[1] > 2.*ep2[0]) { |
226 |
< |
ep[1] -= .125*ep2[1]; |
227 |
< |
ep[0] += .125*ep2[1]; |
228 |
< |
} |
229 |
< |
if (ep2[hp->ns] < .5*ep2[0]) { |
230 |
< |
ep[0] -= .125*ep2[0]; |
231 |
< |
ep[hp->ns] += .125*ep2[0]; |
232 |
< |
} else if (ep2[hp->ns] > 2.*ep2[0]) { |
233 |
< |
ep[hp->ns] -= .125*ep2[hp->ns]; |
234 |
< |
ep[0] += .125*ep2[hp->ns]; |
235 |
< |
} |
221 |
> |
ep2 = ep + hp->ns*hp->ns; |
222 |
> |
for (j = 0; j < hp->ns-1; j++, ep++, ep2++) { |
223 |
> |
ep[0] += .5*ep2[0] + .125*(ep2[1] + ep2[hp->ns]); |
224 |
> |
ep[1] += .125*ep2[0]; |
225 |
> |
ep[hp->ns] += .125*ep2[0]; |
226 |
|
} |
227 |
|
} |
238 |
– |
free(earr2); |
228 |
|
return(earr); |
229 |
|
} |
230 |
|
|
276 |
|
/* set number of divisions */ |
277 |
|
if (backside) wt = -wt; |
278 |
|
if (ambacc <= FTINY && |
279 |
< |
wt > (d *= 0.8*r->rweight/(ambdiv*minweight))) |
279 |
> |
wt > (d *= 0.8*r->rweight/(ambdiv*minweight + 1e-20))) |
280 |
|
wt = d; /* avoid ray termination */ |
281 |
|
n = sqrt(ambdiv * wt) + 0.5; |
282 |
|
i = 1 + (MINADIV-1)*(ambacc > FTINY); |
325 |
|
if (hp->sampOK <= MINADIV*MINADIV) |
326 |
|
return(hp); /* don't bother super-sampling */ |
327 |
|
n = ambssamp*wt + 0.5; |
328 |
< |
if (n > 8) { /* perform super-sampling? */ |
328 |
> |
if (n >= 4*hp->ns) { /* perform super-sampling? */ |
329 |
|
ambsupersamp(hp, n); |
330 |
|
copyscolor(rcol, hp->acol); |
331 |
|
} |