10 |
|
#include "copyright.h" |
11 |
|
|
12 |
|
#include "ray.h" |
13 |
– |
|
13 |
|
#include "ambient.h" |
15 |
– |
|
14 |
|
#include "random.h" |
15 |
|
|
16 |
+ |
#ifdef NEWAMB |
17 |
|
|
18 |
+ |
#else /* ! NEWAMB */ |
19 |
+ |
|
20 |
+ |
|
21 |
|
void |
22 |
|
inithemi( /* initialize sampling hemisphere */ |
23 |
< |
register AMBHEMI *hp, |
23 |
> |
AMBHEMI *hp, |
24 |
|
COLOR ac, |
25 |
|
RAY *r, |
26 |
|
double wt |
27 |
|
) |
28 |
|
{ |
29 |
|
double d; |
30 |
< |
register int i; |
30 |
> |
int i; |
31 |
|
/* set number of divisions */ |
32 |
|
if (ambacc <= FTINY && |
33 |
< |
wt > (d = 0.8*bright(ac)*r->rweight/(ambdiv*minweight))) |
33 |
> |
wt > (d = 0.8*intens(ac)*r->rweight/(ambdiv*minweight))) |
34 |
|
wt = d; /* avoid ray termination */ |
35 |
|
hp->nt = sqrt(ambdiv * wt / PI) + 0.5; |
36 |
|
i = ambacc > FTINY ? 3 : 1; /* minimum number of samples */ |
60 |
|
|
61 |
|
int |
62 |
|
divsample( /* sample a division */ |
63 |
< |
register AMBSAMP *dp, |
63 |
> |
AMBSAMP *dp, |
64 |
|
AMBHEMI *h, |
65 |
|
RAY *r |
66 |
|
) |
71 |
|
double xd, yd, zd; |
72 |
|
double b2; |
73 |
|
double phi; |
74 |
< |
register int i; |
74 |
> |
int i; |
75 |
|
/* ambient coefficient for weight */ |
76 |
|
if (ambacc > FTINY) |
77 |
|
setcolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL); |
96 |
|
ar.rdir[i] = xd*h->ux[i] + |
97 |
|
yd*h->uy[i] + |
98 |
|
zd*h->uz[i]; |
99 |
+ |
checknorm(ar.rdir); |
100 |
|
dimlist[ndims++] = dp->t*h->np + dp->p + 90171; |
101 |
|
rayvalue(&ar); |
102 |
|
ndims--; |
141 |
|
{ |
142 |
|
const AMBSAMP *d1 = (const AMBSAMP *)p1; |
143 |
|
const AMBSAMP *d2 = (const AMBSAMP *)p2; |
144 |
< |
register int c; |
144 |
> |
int c; |
145 |
|
|
146 |
|
if ( (c = d1->t - d2->t) ) |
147 |
|
return(c); |
151 |
|
|
152 |
|
double |
153 |
|
doambient( /* compute ambient component */ |
154 |
< |
COLOR acol, |
154 |
> |
COLOR rcol, |
155 |
|
RAY *r, |
156 |
|
double wt, |
157 |
|
FVECT pg, |
158 |
|
FVECT dg |
159 |
|
) |
160 |
|
{ |
161 |
< |
double b, d; |
161 |
> |
double b, d=0; |
162 |
|
AMBHEMI hemi; |
163 |
|
AMBSAMP *div; |
164 |
|
AMBSAMP dnew; |
165 |
< |
register AMBSAMP *dp; |
165 |
> |
double acol[3]; |
166 |
> |
AMBSAMP *dp; |
167 |
|
double arad; |
168 |
< |
int ndivs; |
169 |
< |
register int i, j; |
168 |
> |
int divcnt; |
169 |
> |
int i, j; |
170 |
|
/* initialize hemisphere */ |
171 |
< |
inithemi(&hemi, acol, r, wt); |
172 |
< |
ndivs = hemi.nt * hemi.np; |
171 |
> |
inithemi(&hemi, rcol, r, wt); |
172 |
> |
divcnt = hemi.nt * hemi.np; |
173 |
|
/* initialize */ |
174 |
|
if (pg != NULL) |
175 |
|
pg[0] = pg[1] = pg[2] = 0.0; |
176 |
|
if (dg != NULL) |
177 |
|
dg[0] = dg[1] = dg[2] = 0.0; |
178 |
< |
setcolor(acol, 0.0, 0.0, 0.0); |
179 |
< |
if (ndivs == 0) |
178 |
> |
setcolor(rcol, 0.0, 0.0, 0.0); |
179 |
> |
if (divcnt == 0) |
180 |
|
return(0.0); |
181 |
|
/* allocate super-samples */ |
182 |
|
if (hemi.ns > 0 || pg != NULL || dg != NULL) { |
183 |
< |
div = (AMBSAMP *)malloc(ndivs*sizeof(AMBSAMP)); |
183 |
> |
div = (AMBSAMP *)malloc(divcnt*sizeof(AMBSAMP)); |
184 |
|
if (div == NULL) |
185 |
|
error(SYSTEM, "out of memory in doambient"); |
186 |
|
} else |
187 |
|
div = NULL; |
188 |
|
/* sample the divisions */ |
189 |
|
arad = 0.0; |
190 |
+ |
acol[0] = acol[1] = acol[2] = 0.0; |
191 |
|
if ((dp = div) == NULL) |
192 |
|
dp = &dnew; |
193 |
+ |
divcnt = 0; |
194 |
|
for (i = 0; i < hemi.nt; i++) |
195 |
|
for (j = 0; j < hemi.np; j++) { |
196 |
|
dp->t = i; dp->p = j; |
198 |
|
dp->r = 0.0; |
199 |
|
dp->n = 0; |
200 |
|
if (divsample(dp, &hemi, r) < 0) { |
201 |
< |
if (div != NULL) dp++; |
202 |
< |
hemi.ns = 0; /* incomplete sampling */ |
197 |
< |
pg = dg = NULL; |
201 |
> |
if (div != NULL) |
202 |
> |
dp++; |
203 |
|
continue; |
204 |
|
} |
205 |
|
arad += dp->r; |
206 |
+ |
divcnt++; |
207 |
|
if (div != NULL) |
208 |
|
dp++; |
209 |
|
else |
210 |
|
addcolor(acol, dp->v); |
211 |
|
} |
212 |
< |
if (hemi.ns > 0 && arad > FTINY && ndivs/arad < minarad) |
212 |
> |
if (!divcnt) { |
213 |
> |
if (div != NULL) |
214 |
> |
free((void *)div); |
215 |
> |
return(0.0); /* no samples taken */ |
216 |
> |
} |
217 |
> |
if (divcnt < hemi.nt*hemi.np) { |
218 |
> |
pg = dg = NULL; /* incomplete sampling */ |
219 |
> |
hemi.ns = 0; |
220 |
> |
} else if (arad > FTINY && divcnt/arad < minarad) { |
221 |
|
hemi.ns = 0; /* close enough */ |
222 |
< |
else if (hemi.ns > 0) { /* else perform super-sampling */ |
222 |
> |
} else if (hemi.ns > 0) { /* else perform super-sampling? */ |
223 |
|
comperrs(div, &hemi); /* compute errors */ |
224 |
< |
qsort(div, ndivs, sizeof(AMBSAMP), ambcmp); /* sort divs */ |
224 |
> |
qsort(div, divcnt, sizeof(AMBSAMP), ambcmp); /* sort divs */ |
225 |
|
/* super-sample */ |
226 |
|
for (i = hemi.ns; i > 0; i--) { |
227 |
|
dnew = *div; |
230 |
|
continue; |
231 |
|
} |
232 |
|
dp = div; /* reinsert */ |
233 |
< |
j = ndivs < i ? ndivs : i; |
233 |
> |
j = divcnt < i ? divcnt : i; |
234 |
|
while (--j > 0 && dnew.k < dp[1].k) { |
235 |
|
*dp = *(dp+1); |
236 |
|
dp++; |
238 |
|
*dp = dnew; |
239 |
|
} |
240 |
|
if (pg != NULL || dg != NULL) /* restore order */ |
241 |
< |
qsort(div, ndivs, sizeof(AMBSAMP), ambnorm); |
241 |
> |
qsort(div, divcnt, sizeof(AMBSAMP), ambnorm); |
242 |
|
} |
243 |
|
/* compute returned values */ |
244 |
|
if (div != NULL) { |
245 |
< |
arad = 0.0; |
246 |
< |
for (i = ndivs, dp = div; i-- > 0; dp++) { |
245 |
> |
arad = 0.0; /* note: divcnt may be < nt*np */ |
246 |
> |
for (i = hemi.nt*hemi.np, dp = div; i-- > 0; dp++) { |
247 |
|
arad += dp->r; |
248 |
|
if (dp->n > 1) { |
249 |
|
b = 1.0/dp->n; |
269 |
|
} |
270 |
|
free((void *)div); |
271 |
|
} |
272 |
+ |
copycolor(rcol, acol); |
273 |
|
if (arad <= FTINY) |
274 |
|
arad = maxarad; |
275 |
|
else |
276 |
< |
arad = (ndivs+hemi.ns)/arad; |
276 |
> |
arad = (divcnt+hemi.ns)/arad; |
277 |
|
if (pg != NULL) { /* reduce radius if gradient large */ |
278 |
|
d = DOT(pg,pg); |
279 |
|
if (d*arad*arad > 1.0) |
296 |
|
void |
297 |
|
comperrs( /* compute initial error estimates */ |
298 |
|
AMBSAMP *da, /* assumes standard ordering */ |
299 |
< |
register AMBHEMI *hp |
299 |
> |
AMBHEMI *hp |
300 |
|
) |
301 |
|
{ |
302 |
|
double b, b2; |
303 |
|
int i, j; |
304 |
< |
register AMBSAMP *dp; |
304 |
> |
AMBSAMP *dp; |
305 |
|
/* sum differences from neighbors */ |
306 |
|
dp = da; |
307 |
|
for (i = 0; i < hp->nt; i++) |
349 |
|
posgradient( /* compute position gradient */ |
350 |
|
FVECT gv, |
351 |
|
AMBSAMP *da, /* assumes standard ordering */ |
352 |
< |
register AMBHEMI *hp |
352 |
> |
AMBHEMI *hp |
353 |
|
) |
354 |
|
{ |
355 |
< |
register int i, j; |
355 |
> |
int i, j; |
356 |
|
double nextsine, lastsine, b, d; |
357 |
|
double mag0, mag1; |
358 |
|
double phi, cosp, sinp, xd, yd; |
359 |
< |
register AMBSAMP *dp; |
359 |
> |
AMBSAMP *dp; |
360 |
|
|
361 |
|
xd = yd = 0.0; |
362 |
|
for (j = 0; j < hp->np; j++) { |
407 |
|
dirgradient( /* compute direction gradient */ |
408 |
|
FVECT gv, |
409 |
|
AMBSAMP *da, /* assumes standard ordering */ |
410 |
< |
register AMBHEMI *hp |
410 |
> |
AMBHEMI *hp |
411 |
|
) |
412 |
|
{ |
413 |
< |
register int i, j; |
413 |
> |
int i, j; |
414 |
|
double mag; |
415 |
|
double phi, xd, yd; |
416 |
< |
register AMBSAMP *dp; |
416 |
> |
AMBSAMP *dp; |
417 |
|
|
418 |
|
xd = yd = 0.0; |
419 |
|
for (j = 0; j < hp->np; j++) { |
436 |
|
for (i = 0; i < 3; i++) |
437 |
|
gv[i] = xd*hp->ux[i] + yd*hp->uy[i]; |
438 |
|
} |
439 |
+ |
|
440 |
+ |
#endif /* ! NEWAMB */ |