7 |
|
* Declarations of external symbols in ambient.h |
8 |
|
*/ |
9 |
|
|
10 |
< |
/* ==================================================================== |
11 |
< |
* The Radiance Software License, Version 1.0 |
12 |
< |
* |
13 |
< |
* Copyright (c) 1990 - 2002 The Regents of the University of California, |
14 |
< |
* through Lawrence Berkeley National Laboratory. All rights reserved. |
15 |
< |
* |
16 |
< |
* Redistribution and use in source and binary forms, with or without |
17 |
< |
* modification, are permitted provided that the following conditions |
18 |
< |
* are met: |
19 |
< |
* |
20 |
< |
* 1. Redistributions of source code must retain the above copyright |
21 |
< |
* notice, this list of conditions and the following disclaimer. |
22 |
< |
* |
23 |
< |
* 2. Redistributions in binary form must reproduce the above copyright |
24 |
< |
* notice, this list of conditions and the following disclaimer in |
25 |
< |
* the documentation and/or other materials provided with the |
26 |
< |
* distribution. |
27 |
< |
* |
28 |
< |
* 3. The end-user documentation included with the redistribution, |
29 |
< |
* if any, must include the following acknowledgment: |
30 |
< |
* "This product includes Radiance software |
31 |
< |
* (http://radsite.lbl.gov/) |
32 |
< |
* developed by the Lawrence Berkeley National Laboratory |
33 |
< |
* (http://www.lbl.gov/)." |
34 |
< |
* Alternately, this acknowledgment may appear in the software itself, |
35 |
< |
* if and wherever such third-party acknowledgments normally appear. |
36 |
< |
* |
37 |
< |
* 4. The names "Radiance," "Lawrence Berkeley National Laboratory" |
38 |
< |
* and "The Regents of the University of California" must |
39 |
< |
* not be used to endorse or promote products derived from this |
40 |
< |
* software without prior written permission. For written |
41 |
< |
* permission, please contact [email protected]. |
42 |
< |
* |
43 |
< |
* 5. Products derived from this software may not be called "Radiance", |
44 |
< |
* nor may "Radiance" appear in their name, without prior written |
45 |
< |
* permission of Lawrence Berkeley National Laboratory. |
46 |
< |
* |
47 |
< |
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
48 |
< |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
49 |
< |
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
50 |
< |
* DISCLAIMED. IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR |
51 |
< |
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
52 |
< |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
53 |
< |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
54 |
< |
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
55 |
< |
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
56 |
< |
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
57 |
< |
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
58 |
< |
* SUCH DAMAGE. |
59 |
< |
* ==================================================================== |
60 |
< |
* |
61 |
< |
* This software consists of voluntary contributions made by many |
62 |
< |
* individuals on behalf of Lawrence Berkeley National Laboratory. For more |
63 |
< |
* information on Lawrence Berkeley National Laboratory, please see |
64 |
< |
* <http://www.lbl.gov/>. |
65 |
< |
*/ |
10 |
> |
#include "copyright.h" |
11 |
|
|
12 |
|
#include "ray.h" |
13 |
|
|
16 |
|
#include "random.h" |
17 |
|
|
18 |
|
|
19 |
< |
static int |
20 |
< |
ambcmp(d1, d2) /* decreasing order */ |
21 |
< |
AMBSAMP *d1, *d2; |
19 |
> |
void |
20 |
> |
inithemi( /* initialize sampling hemisphere */ |
21 |
> |
register AMBHEMI *hp, |
22 |
> |
COLOR ac, |
23 |
> |
RAY *r, |
24 |
> |
double wt |
25 |
> |
) |
26 |
|
{ |
27 |
< |
if (d1->k < d2->k) |
28 |
< |
return(1); |
29 |
< |
if (d1->k > d2->k) |
30 |
< |
return(-1); |
31 |
< |
return(0); |
27 |
> |
double d; |
28 |
> |
register int i; |
29 |
> |
/* set number of divisions */ |
30 |
> |
if (ambacc <= FTINY && |
31 |
> |
wt > (d = 0.8*bright(ac)*r->rweight/(ambdiv*minweight))) |
32 |
> |
wt = d; /* avoid ray termination */ |
33 |
> |
hp->nt = sqrt(ambdiv * wt / PI) + 0.5; |
34 |
> |
i = ambacc > FTINY ? 3 : 1; /* minimum number of samples */ |
35 |
> |
if (hp->nt < i) |
36 |
> |
hp->nt = i; |
37 |
> |
hp->np = PI * hp->nt + 0.5; |
38 |
> |
/* set number of super-samples */ |
39 |
> |
hp->ns = ambssamp * wt + 0.5; |
40 |
> |
/* assign coefficient */ |
41 |
> |
copycolor(hp->acoef, ac); |
42 |
> |
d = 1.0/(hp->nt*hp->np); |
43 |
> |
scalecolor(hp->acoef, d); |
44 |
> |
/* make axes */ |
45 |
> |
VCOPY(hp->uz, r->ron); |
46 |
> |
hp->uy[0] = hp->uy[1] = hp->uy[2] = 0.0; |
47 |
> |
for (i = 0; i < 3; i++) |
48 |
> |
if (hp->uz[i] < 0.6 && hp->uz[i] > -0.6) |
49 |
> |
break; |
50 |
> |
if (i >= 3) |
51 |
> |
error(CONSISTENCY, "bad ray direction in inithemi"); |
52 |
> |
hp->uy[i] = 1.0; |
53 |
> |
fcross(hp->ux, hp->uy, hp->uz); |
54 |
> |
normalize(hp->ux); |
55 |
> |
fcross(hp->uy, hp->uz, hp->ux); |
56 |
|
} |
57 |
|
|
58 |
|
|
86 |
– |
static int |
87 |
– |
ambnorm(d1, d2) /* standard order */ |
88 |
– |
AMBSAMP *d1, *d2; |
89 |
– |
{ |
90 |
– |
register int c; |
91 |
– |
|
92 |
– |
if (c = d1->t - d2->t) |
93 |
– |
return(c); |
94 |
– |
return(d1->p - d2->p); |
95 |
– |
} |
96 |
– |
|
97 |
– |
|
59 |
|
int |
60 |
< |
divsample(dp, h, r) /* sample a division */ |
61 |
< |
register AMBSAMP *dp; |
62 |
< |
AMBHEMI *h; |
63 |
< |
RAY *r; |
60 |
> |
divsample( /* sample a division */ |
61 |
> |
register AMBSAMP *dp, |
62 |
> |
AMBHEMI *h, |
63 |
> |
RAY *r |
64 |
> |
) |
65 |
|
{ |
66 |
|
RAY ar; |
67 |
|
int hlist[3]; |
70 |
|
double b2; |
71 |
|
double phi; |
72 |
|
register int i; |
73 |
< |
|
74 |
< |
if (rayorigin(&ar, r, AMBIENT, AVGREFL) < 0) |
73 |
> |
/* ambient coefficient for weight */ |
74 |
> |
if (ambacc > FTINY) |
75 |
> |
setcolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL); |
76 |
> |
else |
77 |
> |
copycolor(ar.rcoef, h->acoef); |
78 |
> |
if (rayorigin(&ar, AMBIENT, r, ar.rcoef) < 0) |
79 |
|
return(-1); |
80 |
+ |
if (ambacc > FTINY) |
81 |
+ |
copycolor(ar.rcoef, h->acoef); |
82 |
|
hlist[0] = r->rno; |
83 |
|
hlist[1] = dp->t; |
84 |
|
hlist[2] = dp->p; |
95 |
|
dimlist[ndims++] = dp->t*h->np + dp->p + 90171; |
96 |
|
rayvalue(&ar); |
97 |
|
ndims--; |
98 |
+ |
multcolor(ar.rcol, ar.rcoef); /* apply coefficient */ |
99 |
|
addcolor(dp->v, ar.rcol); |
100 |
|
/* use rt to improve gradient calc */ |
101 |
|
if (ar.rt > FTINY && ar.rt < FHUGE) |
111 |
|
} |
112 |
|
|
113 |
|
|
114 |
+ |
static int |
115 |
+ |
ambcmp( /* decreasing order */ |
116 |
+ |
const void *p1, |
117 |
+ |
const void *p2 |
118 |
+ |
) |
119 |
+ |
{ |
120 |
+ |
const AMBSAMP *d1 = (const AMBSAMP *)p1; |
121 |
+ |
const AMBSAMP *d2 = (const AMBSAMP *)p2; |
122 |
+ |
|
123 |
+ |
if (d1->k < d2->k) |
124 |
+ |
return(1); |
125 |
+ |
if (d1->k > d2->k) |
126 |
+ |
return(-1); |
127 |
+ |
return(0); |
128 |
+ |
} |
129 |
+ |
|
130 |
+ |
|
131 |
+ |
static int |
132 |
+ |
ambnorm( /* standard order */ |
133 |
+ |
const void *p1, |
134 |
+ |
const void *p2 |
135 |
+ |
) |
136 |
+ |
{ |
137 |
+ |
const AMBSAMP *d1 = (const AMBSAMP *)p1; |
138 |
+ |
const AMBSAMP *d2 = (const AMBSAMP *)p2; |
139 |
+ |
register int c; |
140 |
+ |
|
141 |
+ |
if ( (c = d1->t - d2->t) ) |
142 |
+ |
return(c); |
143 |
+ |
return(d1->p - d2->p); |
144 |
+ |
} |
145 |
+ |
|
146 |
+ |
|
147 |
|
double |
148 |
< |
doambient(acol, r, wt, pg, dg) /* compute ambient component */ |
149 |
< |
COLOR acol; |
150 |
< |
RAY *r; |
151 |
< |
double wt; |
152 |
< |
FVECT pg, dg; |
148 |
> |
doambient( /* compute ambient component */ |
149 |
> |
COLOR acol, |
150 |
> |
RAY *r, |
151 |
> |
double wt, |
152 |
> |
FVECT pg, |
153 |
> |
FVECT dg |
154 |
> |
) |
155 |
|
{ |
156 |
|
double b, d; |
157 |
|
AMBHEMI hemi; |
159 |
|
AMBSAMP dnew; |
160 |
|
register AMBSAMP *dp; |
161 |
|
double arad; |
162 |
< |
int ndivs, ns; |
162 |
> |
int ndivs; |
163 |
|
register int i, j; |
160 |
– |
/* initialize color */ |
161 |
– |
setcolor(acol, 0.0, 0.0, 0.0); |
164 |
|
/* initialize hemisphere */ |
165 |
< |
inithemi(&hemi, r, wt); |
165 |
> |
inithemi(&hemi, acol, r, wt); |
166 |
|
ndivs = hemi.nt * hemi.np; |
167 |
+ |
/* initialize sum */ |
168 |
+ |
setcolor(acol, 0.0, 0.0, 0.0); |
169 |
|
if (ndivs == 0) |
170 |
|
return(0.0); |
171 |
< |
/* set number of super-samples */ |
172 |
< |
ns = ambssamp * wt + 0.5; |
169 |
< |
if (ns > 0 || pg != NULL || dg != NULL) { |
171 |
> |
/* allocate super-samples */ |
172 |
> |
if (hemi.ns > 0 || pg != NULL || dg != NULL) { |
173 |
|
div = (AMBSAMP *)malloc(ndivs*sizeof(AMBSAMP)); |
174 |
|
if (div == NULL) |
175 |
|
error(SYSTEM, "out of memory in doambient"); |
185 |
|
setcolor(dp->v, 0.0, 0.0, 0.0); |
186 |
|
dp->r = 0.0; |
187 |
|
dp->n = 0; |
188 |
< |
if (divsample(dp, &hemi, r) < 0) |
189 |
< |
goto oopsy; |
188 |
> |
if (divsample(dp, &hemi, r) < 0) { |
189 |
> |
if (div != NULL) dp++; |
190 |
> |
continue; |
191 |
> |
} |
192 |
|
arad += dp->r; |
193 |
|
if (div != NULL) |
194 |
|
dp++; |
195 |
|
else |
196 |
|
addcolor(acol, dp->v); |
197 |
|
} |
198 |
< |
if (ns > 0 && arad > FTINY && ndivs/arad < minarad) |
199 |
< |
ns = 0; /* close enough */ |
200 |
< |
else if (ns > 0) { /* else perform super-sampling */ |
198 |
> |
if (hemi.ns > 0 && arad > FTINY && ndivs/arad < minarad) |
199 |
> |
hemi.ns = 0; /* close enough */ |
200 |
> |
else if (hemi.ns > 0) { /* else perform super-sampling */ |
201 |
|
comperrs(div, &hemi); /* compute errors */ |
202 |
|
qsort(div, ndivs, sizeof(AMBSAMP), ambcmp); /* sort divs */ |
203 |
|
/* super-sample */ |
204 |
< |
for (i = ns; i > 0; i--) { |
205 |
< |
copystruct(&dnew, div); |
206 |
< |
if (divsample(&dnew, &hemi, r) < 0) |
207 |
< |
goto oopsy; |
208 |
< |
/* reinsert */ |
209 |
< |
dp = div; |
204 |
> |
for (i = hemi.ns; i > 0; i--) { |
205 |
> |
dnew = *div; |
206 |
> |
if (divsample(&dnew, &hemi, r) < 0) { |
207 |
> |
dp++; |
208 |
> |
continue; |
209 |
> |
} |
210 |
> |
dp = div; /* reinsert */ |
211 |
|
j = ndivs < i ? ndivs : i; |
212 |
|
while (--j > 0 && dnew.k < dp[1].k) { |
213 |
< |
copystruct(dp, dp+1); |
213 |
> |
*dp = *(dp+1); |
214 |
|
dp++; |
215 |
|
} |
216 |
< |
copystruct(dp, &dnew); |
216 |
> |
*dp = dnew; |
217 |
|
} |
218 |
|
if (pg != NULL || dg != NULL) /* restore order */ |
219 |
|
qsort(div, ndivs, sizeof(AMBSAMP), ambnorm); |
233 |
|
} |
234 |
|
b = bright(acol); |
235 |
|
if (b > FTINY) { |
236 |
< |
b = ndivs/b; |
236 |
> |
b = 1.0/b; /* normalize gradient(s) */ |
237 |
|
if (pg != NULL) { |
238 |
|
posgradient(pg, div, &hemi); |
239 |
|
for (i = 0; i < 3; i++) |
254 |
|
} |
255 |
|
free((void *)div); |
256 |
|
} |
251 |
– |
b = 1.0/ndivs; |
252 |
– |
scalecolor(acol, b); |
257 |
|
if (arad <= FTINY) |
258 |
|
arad = maxarad; |
259 |
|
else |
260 |
< |
arad = (ndivs+ns)/arad; |
260 |
> |
arad = (ndivs+hemi.ns)/arad; |
261 |
|
if (pg != NULL) { /* reduce radius if gradient large */ |
262 |
|
d = DOT(pg,pg); |
263 |
|
if (d*arad*arad > 1.0) |
274 |
|
if ((arad /= sqrt(wt)) > maxarad) |
275 |
|
arad = maxarad; |
276 |
|
return(arad); |
273 |
– |
oopsy: |
274 |
– |
if (div != NULL) |
275 |
– |
free((void *)div); |
276 |
– |
return(0.0); |
277 |
|
} |
278 |
|
|
279 |
|
|
280 |
|
void |
281 |
< |
inithemi(hp, r, wt) /* initialize sampling hemisphere */ |
282 |
< |
register AMBHEMI *hp; |
283 |
< |
RAY *r; |
284 |
< |
double wt; |
281 |
> |
comperrs( /* compute initial error estimates */ |
282 |
> |
AMBSAMP *da, /* assumes standard ordering */ |
283 |
> |
register AMBHEMI *hp |
284 |
> |
) |
285 |
|
{ |
286 |
– |
register int i; |
287 |
– |
/* set number of divisions */ |
288 |
– |
if (wt < (.25*PI)/ambdiv+FTINY) { |
289 |
– |
hp->nt = hp->np = 0; |
290 |
– |
return; /* zero samples */ |
291 |
– |
} |
292 |
– |
hp->nt = sqrt(ambdiv * wt / PI) + 0.5; |
293 |
– |
hp->np = PI * hp->nt + 0.5; |
294 |
– |
/* make axes */ |
295 |
– |
VCOPY(hp->uz, r->ron); |
296 |
– |
hp->uy[0] = hp->uy[1] = hp->uy[2] = 0.0; |
297 |
– |
for (i = 0; i < 3; i++) |
298 |
– |
if (hp->uz[i] < 0.6 && hp->uz[i] > -0.6) |
299 |
– |
break; |
300 |
– |
if (i >= 3) |
301 |
– |
error(CONSISTENCY, "bad ray direction in inithemi"); |
302 |
– |
hp->uy[i] = 1.0; |
303 |
– |
fcross(hp->ux, hp->uy, hp->uz); |
304 |
– |
normalize(hp->ux); |
305 |
– |
fcross(hp->uy, hp->uz, hp->ux); |
306 |
– |
} |
307 |
– |
|
308 |
– |
|
309 |
– |
void |
310 |
– |
comperrs(da, hp) /* compute initial error estimates */ |
311 |
– |
AMBSAMP *da; /* assumes standard ordering */ |
312 |
– |
register AMBHEMI *hp; |
313 |
– |
{ |
286 |
|
double b, b2; |
287 |
|
int i, j; |
288 |
|
register AMBSAMP *dp; |
330 |
|
|
331 |
|
|
332 |
|
void |
333 |
< |
posgradient(gv, da, hp) /* compute position gradient */ |
334 |
< |
FVECT gv; |
335 |
< |
AMBSAMP *da; /* assumes standard ordering */ |
336 |
< |
register AMBHEMI *hp; |
333 |
> |
posgradient( /* compute position gradient */ |
334 |
> |
FVECT gv, |
335 |
> |
AMBSAMP *da, /* assumes standard ordering */ |
336 |
> |
register AMBHEMI *hp |
337 |
> |
) |
338 |
|
{ |
339 |
|
register int i, j; |
340 |
|
double nextsine, lastsine, b, d; |
383 |
|
yd += mag0*sinp + mag1*cosp; |
384 |
|
} |
385 |
|
for (i = 0; i < 3; i++) |
386 |
< |
gv[i] = (xd*hp->ux[i] + yd*hp->uy[i])/PI; |
386 |
> |
gv[i] = (xd*hp->ux[i] + yd*hp->uy[i])*(hp->nt*hp->np)/PI; |
387 |
|
} |
388 |
|
|
389 |
|
|
390 |
|
void |
391 |
< |
dirgradient(gv, da, hp) /* compute direction gradient */ |
392 |
< |
FVECT gv; |
393 |
< |
AMBSAMP *da; /* assumes standard ordering */ |
394 |
< |
register AMBHEMI *hp; |
391 |
> |
dirgradient( /* compute direction gradient */ |
392 |
> |
FVECT gv, |
393 |
> |
AMBSAMP *da, /* assumes standard ordering */ |
394 |
> |
register AMBHEMI *hp |
395 |
> |
) |
396 |
|
{ |
397 |
|
register int i, j; |
398 |
|
double mag; |
418 |
|
yd += mag * tsin(phi); |
419 |
|
} |
420 |
|
for (i = 0; i < 3; i++) |
421 |
< |
gv[i] = (xd*hp->ux[i] + yd*hp->uy[i])/(hp->nt*hp->np); |
421 |
> |
gv[i] = xd*hp->ux[i] + yd*hp->uy[i]; |
422 |
|
} |