ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/rt/ambcomp.c
Revision: 1.2
Committed: Fri Jun 7 13:43:05 1991 UTC (32 years, 11 months ago) by greg
Content type: text/plain
Branch: MAIN
Changes since 1.1: +97 -23 lines
Log Message:
initial implementation of dirgradient() and posgradient()

File Contents

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