ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/rt/ambcomp.c
Revision: 1.4
Committed: Tue Jun 11 16:37:49 1991 UTC (32 years, 10 months ago) by greg
Content type: text/plain
Branch: MAIN
Changes since 1.3: +12 -16 lines
Log Message:
bug fixes

File Contents

# Content
1 /* Copyright (c) 1991 Regents of the University of California */
2
3 #ifndef lint
4 static char SCCSid[] = "$SunId$ LBL";
5 #endif
6
7 /*
8 * Routines to compute "ambient" values using Monte Carlo
9 */
10
11 #include "ray.h"
12
13 #include "ambient.h"
14
15 #include "random.h"
16
17 typedef struct {
18 short t, p; /* theta, phi indices */
19 COLOR v; /* value sum */
20 float r; /* 1/distance sum */
21 float k; /* variance for this division */
22 int n; /* number of subsamples */
23 } AMBSAMP; /* ambient sample division */
24
25 typedef struct {
26 FVECT ux, uy, uz; /* x, y and z axis directions */
27 short nt, np; /* number of theta and phi directions */
28 } AMBHEMI; /* ambient sample hemisphere */
29
30 extern double sin(), cos(), sqrt();
31
32
33 static int
34 ambcmp(d1, d2) /* decreasing order */
35 AMBSAMP *d1, *d2;
36 {
37 if (d1->k < d2->k)
38 return(1);
39 if (d1->k > d2->k)
40 return(-1);
41 return(0);
42 }
43
44
45 static int
46 ambnorm(d1, d2) /* standard order */
47 AMBSAMP *d1, *d2;
48 {
49 register int c;
50
51 if (c = d1->t - d2->t)
52 return(c);
53 return(d1->p - d2->p);
54 }
55
56
57 divsample(dp, h, r) /* sample a division */
58 register AMBSAMP *dp;
59 AMBHEMI *h;
60 RAY *r;
61 {
62 RAY ar;
63 int hlist[4];
64 double xd, yd, zd;
65 double b2;
66 double phi;
67 register int i;
68
69 if (rayorigin(&ar, r, AMBIENT, 0.5) < 0)
70 return(-1);
71 hlist[0] = r->rno;
72 hlist[1] = dp->t;
73 hlist[2] = dp->p;
74 hlist[3] = 0;
75 zd = sqrt((dp->t+urand(ilhash(hlist,4)+dp->n))/h->nt);
76 hlist[3] = 1;
77 phi = 2.0*PI * (dp->p+urand(ilhash(hlist,4)+dp->n))/h->np;
78 xd = cos(phi) * zd;
79 yd = sin(phi) * zd;
80 zd = sqrt(1.0 - zd*zd);
81 for (i = 0; i < 3; i++)
82 ar.rdir[i] = xd*h->ux[i] +
83 yd*h->uy[i] +
84 zd*h->uz[i];
85 dimlist[ndims++] = dp->t*h->np + dp->p + 90171;
86 rayvalue(&ar);
87 ndims--;
88 addcolor(dp->v, ar.rcol);
89 if (ar.rt < FHUGE)
90 dp->r += 1.0/ar.rt;
91 /* (re)initialize error */
92 if (dp->n++) {
93 b2 = bright(dp->v)/dp->n - bright(ar.rcol);
94 b2 = b2*b2 + dp->k*((dp->n-1)*(dp->n-1));
95 dp->k = b2/(dp->n*dp->n);
96 } else
97 dp->k = 0.0;
98 return(0);
99 }
100
101
102 double
103 doambient(acol, r, pg, dg) /* compute ambient component */
104 COLOR acol;
105 RAY *r;
106 FVECT pg, dg;
107 {
108 double b, d;
109 AMBHEMI hemi;
110 AMBSAMP *div;
111 AMBSAMP dnew;
112 register AMBSAMP *dp;
113 double arad;
114 int ndivs, ns;
115 register int i, j;
116 /* initialize color */
117 setcolor(acol, 0.0, 0.0, 0.0);
118 /* initialize hemisphere */
119 inithemi(&hemi, r);
120 ndivs = hemi.nt * hemi.np;
121 if (ndivs == 0)
122 return(0.0);
123 /* set number of super-samples */
124 ns = ambssamp * r->rweight + 0.5;
125 if (ns > 0 || pg != NULL || dg != NULL) {
126 div = (AMBSAMP *)malloc(ndivs*sizeof(AMBSAMP));
127 if (div == NULL)
128 error(SYSTEM, "out of memory in doambient");
129 } else
130 div = NULL;
131 /* sample the divisions */
132 arad = 0.0;
133 if ((dp = div) == NULL)
134 dp = &dnew;
135 for (i = 0; i < hemi.nt; i++)
136 for (j = 0; j < hemi.np; j++) {
137 dp->t = i; dp->p = j;
138 setcolor(dp->v, 0.0, 0.0, 0.0);
139 dp->r = 0.0;
140 dp->n = 0;
141 if (divsample(dp, &hemi, r) < 0)
142 goto oopsy;
143 if (div != NULL)
144 dp++;
145 else {
146 addcolor(acol, dp->v);
147 arad += dp->r;
148 }
149 }
150 if (ns > 0) { /* perform super-sampling */
151 comperrs(div, &hemi); /* compute errors */
152 qsort(div, ndivs, sizeof(AMBSAMP), ambcmp); /* sort divs */
153 /* super-sample */
154 for (i = ns; i > 0; i--) {
155 copystruct(&dnew, div);
156 if (divsample(&dnew, &hemi, r) < 0)
157 goto oopsy;
158 /* reinsert */
159 dp = div;
160 j = ndivs < i ? ndivs : i;
161 while (--j > 0 && dnew.k < dp[1].k) {
162 copystruct(dp, dp+1);
163 dp++;
164 }
165 copystruct(dp, &dnew);
166 }
167 if (pg != NULL || dg != NULL) /* restore order */
168 qsort(div, ndivs, sizeof(AMBSAMP), ambnorm);
169 }
170 /* compute returned values */
171 if (div != NULL) {
172 for (i = ndivs, dp = div; i-- > 0; dp++) {
173 arad += dp->r;
174 if (dp->n > 1) {
175 b = 1.0/dp->n;
176 scalecolor(dp->v, b);
177 dp->r *= b;
178 dp->n = 1;
179 }
180 addcolor(acol, dp->v);
181 }
182 if (pg != NULL)
183 posgradient(pg, div, &hemi);
184 if (dg != NULL)
185 dirgradient(dg, div, &hemi);
186 free((char *)div);
187 }
188 b = 1.0/ndivs;
189 scalecolor(acol, b);
190 if (arad <= FTINY)
191 arad = FHUGE;
192 else
193 arad = (ndivs+ns)/arad;
194 if (arad > maxarad)
195 arad = maxarad;
196 else if (arad < minarad)
197 arad = minarad;
198 arad /= sqrt(r->rweight);
199 return(arad);
200 oopsy:
201 if (div != NULL)
202 free((char *)div);
203 return(0.0);
204 }
205
206
207 inithemi(hp, r) /* initialize sampling hemisphere */
208 register AMBHEMI *hp;
209 RAY *r;
210 {
211 register int i;
212 /* set number of divisions */
213 hp->nt = sqrt(ambdiv * r->rweight * 0.5) + 0.5;
214 hp->np = 2 * hp->nt;
215 /* make axes */
216 VCOPY(hp->uz, r->ron);
217 hp->uy[0] = hp->uy[1] = hp->uy[2] = 0.0;
218 for (i = 0; i < 3; i++)
219 if (hp->uz[i] < 0.6 && hp->uz[i] > -0.6)
220 break;
221 if (i >= 3)
222 error(CONSISTENCY, "bad ray direction in inithemi");
223 hp->uy[i] = 1.0;
224 fcross(hp->ux, hp->uy, hp->uz);
225 normalize(hp->ux);
226 fcross(hp->uy, hp->uz, hp->ux);
227 }
228
229
230 comperrs(da, hp) /* compute initial error estimates */
231 AMBSAMP *da; /* assumes standard ordering */
232 register AMBHEMI *hp;
233 {
234 double b, b2;
235 int i, j;
236 register AMBSAMP *dp;
237 /* sum differences from neighbors */
238 dp = da;
239 for (i = 0; i < hp->nt; i++)
240 for (j = 0; j < hp->np; j++) {
241 b = bright(dp[0].v);
242 if (i > 0) { /* from above */
243 b2 = bright(dp[-hp->np].v) - b;
244 b2 *= b2 * 0.25;
245 dp[0].k += b2;
246 dp[-hp->np].k += b2;
247 }
248 if (j > 0) { /* from behind */
249 b2 = bright(dp[-1].v) - b;
250 b2 *= b2 * 0.25;
251 dp[0].k += b2;
252 dp[-1].k += b2;
253 } else { /* around */
254 b2 = bright(dp[hp->np-1].v) - b;
255 b2 *= b2 * 0.25;
256 dp[0].k += b2;
257 dp[hp->np-1].k += b2;
258 }
259 dp++;
260 }
261 /* divide by number of neighbors */
262 dp = da;
263 for (j = 0; j < hp->np; j++) /* top row */
264 (dp++)->k *= 1.0/3.0;
265 if (hp->nt < 2)
266 return;
267 for (i = 1; i < hp->nt-1; i++) /* central region */
268 for (j = 0; j < hp->np; j++)
269 (dp++)->k *= 0.25;
270 for (j = 0; j < hp->np; j++) /* bottom row */
271 (dp++)->k *= 1.0/3.0;
272 }
273
274
275 posgradient(gv, da, hp) /* compute position gradient */
276 FVECT gv;
277 AMBSAMP *da; /* assumes standard ordering */
278 AMBHEMI *hp;
279 {
280 register int i, j;
281 double b, d;
282 double mag0, mag1;
283 double phi, cosp, sinp, xd, yd;
284 register AMBSAMP *dp;
285
286 xd = yd = 0.0;
287 for (j = 0; j < hp->np; j++) {
288 dp = da + j;
289 mag0 = mag1 = 0.0;
290 for (i = 0; i < hp->nt; i++) {
291 #ifdef DEBUG
292 if (dp->t != i || dp->p != j)
293 error(CONSISTENCY,
294 "division order in posgradient");
295 #endif
296 b = bright(dp->v);
297 if (i > 0) {
298 d = dp[-hp->np].r;
299 if (dp[0].r > d) d = dp[0].r;
300 d *= 1.0 - sqrt((double)i/hp->nt);
301 mag0 += d*(b - bright(dp[-hp->np].v));
302 }
303 if (j > 0) {
304 d = dp[-1].r;
305 if (dp[0].r > d) d = dp[0].r;
306 mag1 += d*(b - bright(dp[-1].v));
307 } else {
308 d = dp[hp->np-1].r;
309 if (dp[0].r > d) d = dp[0].r;
310 mag1 += d*(b - bright(dp[hp->np-1].v));
311 }
312 dp += hp->np;
313 }
314 if (hp->nt > 1) {
315 mag0 /= (double)hp->np;
316 mag1 /= (double)hp->nt;
317 }
318 phi = 2.0*PI * (double)j/hp->np;
319 cosp = cos(phi); sinp = sin(phi);
320 xd += mag0*cosp - mag1*sinp;
321 yd += mag0*sinp + mag1*cosp;
322 }
323 for (i = 0; i < 3; i++)
324 gv[i] = xd*hp->ux[i] + yd*hp->uy[i];
325 }
326
327
328 dirgradient(gv, da, hp) /* compute direction gradient */
329 FVECT gv;
330 AMBSAMP *da; /* assumes standard ordering */
331 AMBHEMI *hp;
332 {
333 register int i, j;
334 double mag;
335 double phi, xd, yd;
336 register AMBSAMP *dp;
337
338 xd = yd = 0.0;
339 for (j = 0; j < hp->np; j++) {
340 dp = da + j;
341 mag = 0.0;
342 for (i = 0; i < hp->nt; i++) {
343 #ifdef DEBUG
344 if (dp->t != i || dp->p != j)
345 error(CONSISTENCY,
346 "division order in dirgradient");
347 #endif
348 mag += sqrt((i+.5)/hp->nt)*bright(dp->v);
349 dp += hp->np;
350 }
351 phi = 2.0*PI * (j+.5)/hp->np + PI/2.0;
352 xd += mag * cos(phi);
353 yd += mag * sin(phi);
354 }
355 for (i = 0; i < 3; i++)
356 gv[i] = (xd*hp->ux[i] + yd*hp->uy[i])/(hp->nt*hp->np);
357 }