ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/rt/ambcomp.c
Revision: 2.58
Committed: Sun May 11 19:03:37 2014 UTC (9 years, 11 months ago) by greg
Content type: text/plain
Branch: MAIN
Changes since 2.57: +18 -5 lines
Log Message:
Changes to hem-in too-large cache radii with -ar 0

File Contents

# Content
1 #ifndef lint
2 static const char RCSid[] = "$Id: ambcomp.c,v 2.57 2014/05/09 22:53:11 greg Exp $";
3 #endif
4 /*
5 * Routines to compute "ambient" values using Monte Carlo
6 *
7 * Hessian calculations based on "Practical Hessian-Based Error Control
8 * for Irradiance Caching" by Schwarzhaupt, Wann Jensen, & Jarosz
9 * from ACM SIGGRAPH Asia 2012 conference proceedings.
10 *
11 * Added book-keeping optimization to avoid calculations that would
12 * cancel due to traversal both directions on edges that are adjacent
13 * to same-valued triangles. This cuts about half of Hessian math.
14 *
15 * Declarations of external symbols in ambient.h
16 */
17
18 #include "copyright.h"
19
20 #include "ray.h"
21 #include "ambient.h"
22 #include "random.h"
23
24 #ifdef NEWAMB
25
26 extern void SDsquare2disk(double ds[2], double seedx, double seedy);
27
28 typedef struct {
29 COLOR v; /* hemisphere sample value */
30 float d; /* reciprocal distance (1/rt) */
31 FVECT p; /* intersection point */
32 } AMBSAMP; /* sample value */
33
34 typedef struct {
35 RAY *rp; /* originating ray sample */
36 FVECT ux, uy; /* tangent axis unit vectors */
37 int ns; /* number of samples per axis */
38 COLOR acoef; /* division contribution coefficient */
39 AMBSAMP sa[1]; /* sample array (extends struct) */
40 } AMBHEMI; /* ambient sample hemisphere */
41
42 #define AI(h,i,j) ((i)*(h)->ns + (j))
43 #define ambsam(h,i,j) (h)->sa[AI(h,i,j)]
44
45 typedef struct {
46 FVECT r_i, r_i1, e_i, rcp, rI2_eJ2;
47 double I1, I2;
48 } FFTRI; /* vectors and coefficients for Hessian calculation */
49
50
51 static AMBHEMI *
52 inithemi( /* initialize sampling hemisphere */
53 COLOR ac,
54 RAY *r,
55 double wt
56 )
57 {
58 AMBHEMI *hp;
59 double d;
60 int n, i;
61 /* set number of divisions */
62 if (ambacc <= FTINY &&
63 wt > (d = 0.8*intens(ac)*r->rweight/(ambdiv*minweight)))
64 wt = d; /* avoid ray termination */
65 n = sqrt(ambdiv * wt) + 0.5;
66 i = 1 + 5*(ambacc > FTINY); /* minimum number of samples */
67 if (n < i)
68 n = i;
69 /* allocate sampling array */
70 hp = (AMBHEMI *)malloc(sizeof(AMBHEMI) + sizeof(AMBSAMP)*(n*n - 1));
71 if (hp == NULL)
72 return(NULL);
73 hp->rp = r;
74 hp->ns = n;
75 /* assign coefficient */
76 copycolor(hp->acoef, ac);
77 d = 1.0/(n*n);
78 scalecolor(hp->acoef, d);
79 /* make tangent plane axes */
80 hp->uy[0] = 0.5 - frandom();
81 hp->uy[1] = 0.5 - frandom();
82 hp->uy[2] = 0.5 - frandom();
83 for (i = 3; i--; )
84 if ((-0.6 < r->ron[i]) & (r->ron[i] < 0.6))
85 break;
86 if (i < 0)
87 error(CONSISTENCY, "bad ray direction in inithemi");
88 hp->uy[i] = 1.0;
89 VCROSS(hp->ux, hp->uy, r->ron);
90 normalize(hp->ux);
91 VCROSS(hp->uy, r->ron, hp->ux);
92 /* we're ready to sample */
93 return(hp);
94 }
95
96
97 /* Sample ambient division and apply weighting coefficient */
98 static int
99 getambsamp(RAY *arp, AMBHEMI *hp, int i, int j, int n)
100 {
101 int hlist[3], ii;
102 double spt[2], zd;
103 /* ambient coefficient for weight */
104 if (ambacc > FTINY)
105 setcolor(arp->rcoef, AVGREFL, AVGREFL, AVGREFL);
106 else
107 copycolor(arp->rcoef, hp->acoef);
108 if (rayorigin(arp, AMBIENT, hp->rp, arp->rcoef) < 0)
109 return(0);
110 if (ambacc > FTINY) {
111 multcolor(arp->rcoef, hp->acoef);
112 scalecolor(arp->rcoef, 1./AVGREFL);
113 }
114 hlist[0] = hp->rp->rno;
115 hlist[1] = j;
116 hlist[2] = i;
117 multisamp(spt, 2, urand(ilhash(hlist,3)+n));
118 if (!n) { /* avoid border samples for n==0 */
119 if ((spt[0] < 0.1) | (spt[0] >= 0.9))
120 spt[0] = 0.1 + 0.8*frandom();
121 if ((spt[1] < 0.1) | (spt[1] >= 0.9))
122 spt[1] = 0.1 + 0.8*frandom();
123 }
124 SDsquare2disk(spt, (j+spt[1])/hp->ns, (i+spt[0])/hp->ns);
125 zd = sqrt(1. - spt[0]*spt[0] - spt[1]*spt[1]);
126 for (ii = 3; ii--; )
127 arp->rdir[ii] = spt[0]*hp->ux[ii] +
128 spt[1]*hp->uy[ii] +
129 zd*hp->rp->ron[ii];
130 checknorm(arp->rdir);
131 dimlist[ndims++] = AI(hp,i,j) + 90171;
132 rayvalue(arp); /* evaluate ray */
133 ndims--; /* apply coefficient */
134 multcolor(arp->rcol, arp->rcoef);
135 return(1);
136 }
137
138
139 static AMBSAMP *
140 ambsample( /* initial ambient division sample */
141 AMBHEMI *hp,
142 int i,
143 int j
144 )
145 {
146 AMBSAMP *ap = &ambsam(hp,i,j);
147 RAY ar;
148 /* generate hemispherical sample */
149 if (!getambsamp(&ar, hp, i, j, 0) || ar.rt <= FTINY) {
150 memset(ap, 0, sizeof(AMBSAMP));
151 return(NULL);
152 }
153 ap->d = 1.0/ar.rt; /* limit vertex distance */
154 if (ar.rt > 10.0*thescene.cusize)
155 ar.rt = 10.0*thescene.cusize;
156 VSUM(ap->p, ar.rorg, ar.rdir, ar.rt);
157 copycolor(ap->v, ar.rcol);
158 return(ap);
159 }
160
161
162 /* Estimate errors based on ambient division differences */
163 static float *
164 getambdiffs(AMBHEMI *hp)
165 {
166 float *earr = (float *)calloc(hp->ns*hp->ns, sizeof(float));
167 float *ep;
168 AMBSAMP *ap;
169 double b, d2;
170 int i, j;
171
172 if (earr == NULL) /* out of memory? */
173 return(NULL);
174 /* compute squared neighbor diffs */
175 for (ap = hp->sa, ep = earr, i = 0; i < hp->ns; i++)
176 for (j = 0; j < hp->ns; j++, ap++, ep++) {
177 b = bright(ap[0].v);
178 if (i) { /* from above */
179 d2 = b - bright(ap[-hp->ns].v);
180 d2 *= d2;
181 ep[0] += d2;
182 ep[-hp->ns] += d2;
183 }
184 if (!j) continue;
185 /* from behind */
186 d2 = b - bright(ap[-1].v);
187 d2 *= d2;
188 ep[0] += d2;
189 ep[-1] += d2;
190 if (!i) continue;
191 /* diagonal */
192 d2 = b - bright(ap[-hp->ns-1].v);
193 d2 *= d2;
194 ep[0] += d2;
195 ep[-hp->ns-1] += d2;
196 }
197 /* correct for number of neighbors */
198 earr[0] *= 8./3.;
199 earr[hp->ns-1] *= 8./3.;
200 earr[(hp->ns-1)*hp->ns] *= 8./3.;
201 earr[(hp->ns-1)*hp->ns + hp->ns-1] *= 8./3.;
202 for (i = 1; i < hp->ns-1; i++) {
203 earr[i*hp->ns] *= 8./5.;
204 earr[i*hp->ns + hp->ns-1] *= 8./5.;
205 }
206 for (j = 1; j < hp->ns-1; j++) {
207 earr[j] *= 8./5.;
208 earr[(hp->ns-1)*hp->ns + j] *= 8./5.;
209 }
210 return(earr);
211 }
212
213
214 /* Perform super-sampling on hemisphere (introduces bias) */
215 static void
216 ambsupersamp(double acol[3], AMBHEMI *hp, int cnt)
217 {
218 float *earr = getambdiffs(hp);
219 double e2rem = 0;
220 AMBSAMP *ap;
221 RAY ar;
222 double asum[3];
223 float *ep;
224 int i, j, n, nss;
225
226 if (earr == NULL) /* just skip calc. if no memory */
227 return;
228 /* accumulate estimated variances */
229 for (ep = earr + hp->ns*hp->ns; ep > earr; )
230 e2rem += *--ep;
231 ep = earr; /* perform super-sampling */
232 for (ap = hp->sa, i = 0; i < hp->ns; i++)
233 for (j = 0; j < hp->ns; j++, ap++) {
234 if (e2rem <= FTINY)
235 goto done; /* nothing left to do */
236 nss = *ep/e2rem*cnt + frandom();
237 asum[0] = asum[1] = asum[2] = 0.0;
238 for (n = 1; n <= nss; n++) {
239 if (!getambsamp(&ar, hp, i, j, n)) {
240 nss = n-1;
241 break;
242 }
243 addcolor(asum, ar.rcol);
244 }
245 if (nss) { /* update returned ambient value */
246 const double ssf = 1./(nss + 1.);
247 for (n = 3; n--; )
248 acol[n] += ssf*asum[n] +
249 (ssf - 1.)*colval(ap->v,n);
250 }
251 e2rem -= *ep++; /* update remainders */
252 cnt -= nss;
253 }
254 done:
255 free(earr);
256 }
257
258
259 /* Return brightness of farthest ambient sample */
260 static double
261 back_ambval(AMBHEMI *hp, const int n1, const int n2, const int n3)
262 {
263 if (hp->sa[n1].d <= hp->sa[n2].d) {
264 if (hp->sa[n1].d <= hp->sa[n3].d)
265 return(colval(hp->sa[n1].v,CIEY));
266 return(colval(hp->sa[n3].v,CIEY));
267 }
268 if (hp->sa[n2].d <= hp->sa[n3].d)
269 return(colval(hp->sa[n2].v,CIEY));
270 return(colval(hp->sa[n3].v,CIEY));
271 }
272
273
274 /* Compute vectors and coefficients for Hessian/gradient calcs */
275 static void
276 comp_fftri(FFTRI *ftp, AMBHEMI *hp, const int n0, const int n1)
277 {
278 double rdot_cp, dot_e, dot_er, rdot_r, rdot_r1, J2;
279 int ii;
280
281 VSUB(ftp->r_i, hp->sa[n0].p, hp->rp->rop);
282 VSUB(ftp->r_i1, hp->sa[n1].p, hp->rp->rop);
283 VSUB(ftp->e_i, hp->sa[n1].p, hp->sa[n0].p);
284 VCROSS(ftp->rcp, ftp->r_i, ftp->r_i1);
285 rdot_cp = 1.0/DOT(ftp->rcp,ftp->rcp);
286 dot_e = DOT(ftp->e_i,ftp->e_i);
287 dot_er = DOT(ftp->e_i, ftp->r_i);
288 rdot_r = 1.0/DOT(ftp->r_i,ftp->r_i);
289 rdot_r1 = 1.0/DOT(ftp->r_i1,ftp->r_i1);
290 ftp->I1 = acos( DOT(ftp->r_i, ftp->r_i1) * sqrt(rdot_r*rdot_r1) ) *
291 sqrt( rdot_cp );
292 ftp->I2 = ( DOT(ftp->e_i, ftp->r_i1)*rdot_r1 - dot_er*rdot_r +
293 dot_e*ftp->I1 )*0.5*rdot_cp;
294 J2 = ( 0.5*(rdot_r - rdot_r1) - dot_er*ftp->I2 ) / dot_e;
295 for (ii = 3; ii--; )
296 ftp->rI2_eJ2[ii] = ftp->I2*ftp->r_i[ii] + J2*ftp->e_i[ii];
297 }
298
299
300 /* Compose 3x3 matrix from two vectors */
301 static void
302 compose_matrix(FVECT mat[3], FVECT va, FVECT vb)
303 {
304 mat[0][0] = 2.0*va[0]*vb[0];
305 mat[1][1] = 2.0*va[1]*vb[1];
306 mat[2][2] = 2.0*va[2]*vb[2];
307 mat[0][1] = mat[1][0] = va[0]*vb[1] + va[1]*vb[0];
308 mat[0][2] = mat[2][0] = va[0]*vb[2] + va[2]*vb[0];
309 mat[1][2] = mat[2][1] = va[1]*vb[2] + va[2]*vb[1];
310 }
311
312
313 /* Compute partial 3x3 Hessian matrix for edge */
314 static void
315 comp_hessian(FVECT hess[3], FFTRI *ftp, FVECT nrm)
316 {
317 FVECT ncp;
318 FVECT m1[3], m2[3], m3[3], m4[3];
319 double d1, d2, d3, d4;
320 double I3, J3, K3;
321 int i, j;
322 /* compute intermediate coefficients */
323 d1 = 1.0/DOT(ftp->r_i,ftp->r_i);
324 d2 = 1.0/DOT(ftp->r_i1,ftp->r_i1);
325 d3 = 1.0/DOT(ftp->e_i,ftp->e_i);
326 d4 = DOT(ftp->e_i, ftp->r_i);
327 I3 = ( DOT(ftp->e_i, ftp->r_i1)*d2*d2 - d4*d1*d1 + 3.0/d3*ftp->I2 )
328 / ( 4.0*DOT(ftp->rcp,ftp->rcp) );
329 J3 = 0.25*d3*(d1*d1 - d2*d2) - d4*d3*I3;
330 K3 = d3*(ftp->I2 - I3/d1 - 2.0*d4*J3);
331 /* intermediate matrices */
332 VCROSS(ncp, nrm, ftp->e_i);
333 compose_matrix(m1, ncp, ftp->rI2_eJ2);
334 compose_matrix(m2, ftp->r_i, ftp->r_i);
335 compose_matrix(m3, ftp->e_i, ftp->e_i);
336 compose_matrix(m4, ftp->r_i, ftp->e_i);
337 d1 = DOT(nrm, ftp->rcp);
338 d2 = -d1*ftp->I2;
339 d1 *= 2.0;
340 for (i = 3; i--; ) /* final matrix sum */
341 for (j = 3; j--; ) {
342 hess[i][j] = m1[i][j] + d1*( I3*m2[i][j] + K3*m3[i][j] +
343 2.0*J3*m4[i][j] );
344 hess[i][j] += d2*(i==j);
345 hess[i][j] *= -1.0/PI;
346 }
347 }
348
349
350 /* Reverse hessian calculation result for edge in other direction */
351 static void
352 rev_hessian(FVECT hess[3])
353 {
354 int i;
355
356 for (i = 3; i--; ) {
357 hess[i][0] = -hess[i][0];
358 hess[i][1] = -hess[i][1];
359 hess[i][2] = -hess[i][2];
360 }
361 }
362
363
364 /* Add to radiometric Hessian from the given triangle */
365 static void
366 add2hessian(FVECT hess[3], FVECT ehess1[3],
367 FVECT ehess2[3], FVECT ehess3[3], double v)
368 {
369 int i, j;
370
371 for (i = 3; i--; )
372 for (j = 3; j--; )
373 hess[i][j] += v*( ehess1[i][j] + ehess2[i][j] + ehess3[i][j] );
374 }
375
376
377 /* Compute partial displacement form factor gradient for edge */
378 static void
379 comp_gradient(FVECT grad, FFTRI *ftp, FVECT nrm)
380 {
381 FVECT ncp;
382 double f1;
383 int i;
384
385 f1 = 2.0*DOT(nrm, ftp->rcp);
386 VCROSS(ncp, nrm, ftp->e_i);
387 for (i = 3; i--; )
388 grad[i] = (0.5/PI)*( ftp->I1*ncp[i] + f1*ftp->rI2_eJ2[i] );
389 }
390
391
392 /* Reverse gradient calculation result for edge in other direction */
393 static void
394 rev_gradient(FVECT grad)
395 {
396 grad[0] = -grad[0];
397 grad[1] = -grad[1];
398 grad[2] = -grad[2];
399 }
400
401
402 /* Add to displacement gradient from the given triangle */
403 static void
404 add2gradient(FVECT grad, FVECT egrad1, FVECT egrad2, FVECT egrad3, double v)
405 {
406 int i;
407
408 for (i = 3; i--; )
409 grad[i] += v*( egrad1[i] + egrad2[i] + egrad3[i] );
410 }
411
412
413 /* Compute anisotropic radii and eigenvector directions */
414 static void
415 eigenvectors(FVECT uv[2], float ra[2], FVECT hessian[3])
416 {
417 double hess2[2][2];
418 FVECT a, b;
419 double evalue[2], slope1, xmag1;
420 int i;
421 /* project Hessian to sample plane */
422 for (i = 3; i--; ) {
423 a[i] = DOT(hessian[i], uv[0]);
424 b[i] = DOT(hessian[i], uv[1]);
425 }
426 hess2[0][0] = DOT(uv[0], a);
427 hess2[0][1] = DOT(uv[0], b);
428 hess2[1][0] = DOT(uv[1], a);
429 hess2[1][1] = DOT(uv[1], b);
430 /* compute eigenvalue(s) */
431 i = quadratic(evalue, 1.0, -hess2[0][0]-hess2[1][1],
432 hess2[0][0]*hess2[1][1]-hess2[0][1]*hess2[1][0]);
433 if (i == 1) /* double-root (circle) */
434 evalue[1] = evalue[0];
435 if (!i || ((evalue[0] = fabs(evalue[0])) <= FTINY*FTINY) |
436 ((evalue[1] = fabs(evalue[1])) <= FTINY*FTINY) ) {
437 ra[0] = ra[1] = maxarad;
438 return;
439 }
440 if (evalue[0] > evalue[1]) {
441 ra[0] = sqrt(sqrt(4.0/evalue[0]));
442 ra[1] = sqrt(sqrt(4.0/evalue[1]));
443 slope1 = evalue[1];
444 } else {
445 ra[0] = sqrt(sqrt(4.0/evalue[1]));
446 ra[1] = sqrt(sqrt(4.0/evalue[0]));
447 slope1 = evalue[0];
448 }
449 /* compute unit eigenvectors */
450 if (fabs(hess2[0][1]) <= FTINY)
451 return; /* uv OK as is */
452 slope1 = (slope1 - hess2[0][0]) / hess2[0][1];
453 xmag1 = sqrt(1.0/(1.0 + slope1*slope1));
454 for (i = 3; i--; ) {
455 b[i] = xmag1*uv[0][i] + slope1*xmag1*uv[1][i];
456 a[i] = slope1*xmag1*uv[0][i] - xmag1*uv[1][i];
457 }
458 VCOPY(uv[0], a);
459 VCOPY(uv[1], b);
460 }
461
462
463 static void
464 ambHessian( /* anisotropic radii & pos. gradient */
465 AMBHEMI *hp,
466 FVECT uv[2], /* returned */
467 float ra[2], /* returned (optional) */
468 float pg[2] /* returned (optional) */
469 )
470 {
471 static char memerrmsg[] = "out of memory in ambHessian()";
472 FVECT (*hessrow)[3] = NULL;
473 FVECT *gradrow = NULL;
474 FVECT hessian[3];
475 FVECT gradient;
476 FFTRI fftr;
477 int i, j;
478 /* be sure to assign unit vectors */
479 VCOPY(uv[0], hp->ux);
480 VCOPY(uv[1], hp->uy);
481 /* clock-wise vertex traversal from sample POV */
482 if (ra != NULL) { /* initialize Hessian row buffer */
483 hessrow = (FVECT (*)[3])malloc(sizeof(FVECT)*3*(hp->ns-1));
484 if (hessrow == NULL)
485 error(SYSTEM, memerrmsg);
486 memset(hessian, 0, sizeof(hessian));
487 } else if (pg == NULL) /* bogus call? */
488 return;
489 if (pg != NULL) { /* initialize form factor row buffer */
490 gradrow = (FVECT *)malloc(sizeof(FVECT)*(hp->ns-1));
491 if (gradrow == NULL)
492 error(SYSTEM, memerrmsg);
493 memset(gradient, 0, sizeof(gradient));
494 }
495 /* compute first row of edges */
496 for (j = 0; j < hp->ns-1; j++) {
497 comp_fftri(&fftr, hp, AI(hp,0,j), AI(hp,0,j+1));
498 if (hessrow != NULL)
499 comp_hessian(hessrow[j], &fftr, hp->rp->ron);
500 if (gradrow != NULL)
501 comp_gradient(gradrow[j], &fftr, hp->rp->ron);
502 }
503 /* sum each row of triangles */
504 for (i = 0; i < hp->ns-1; i++) {
505 FVECT hesscol[3]; /* compute first vertical edge */
506 FVECT gradcol;
507 comp_fftri(&fftr, hp, AI(hp,i,0), AI(hp,i+1,0));
508 if (hessrow != NULL)
509 comp_hessian(hesscol, &fftr, hp->rp->ron);
510 if (gradrow != NULL)
511 comp_gradient(gradcol, &fftr, hp->rp->ron);
512 for (j = 0; j < hp->ns-1; j++) {
513 FVECT hessdia[3]; /* compute triangle contributions */
514 FVECT graddia;
515 double backg;
516 backg = back_ambval(hp, AI(hp,i,j),
517 AI(hp,i,j+1), AI(hp,i+1,j));
518 /* diagonal (inner) edge */
519 comp_fftri(&fftr, hp, AI(hp,i,j+1), AI(hp,i+1,j));
520 if (hessrow != NULL) {
521 comp_hessian(hessdia, &fftr, hp->rp->ron);
522 rev_hessian(hesscol);
523 add2hessian(hessian, hessrow[j], hessdia, hesscol, backg);
524 }
525 if (gradrow != NULL) {
526 comp_gradient(graddia, &fftr, hp->rp->ron);
527 rev_gradient(gradcol);
528 add2gradient(gradient, gradrow[j], graddia, gradcol, backg);
529 }
530 /* initialize edge in next row */
531 comp_fftri(&fftr, hp, AI(hp,i+1,j+1), AI(hp,i+1,j));
532 if (hessrow != NULL)
533 comp_hessian(hessrow[j], &fftr, hp->rp->ron);
534 if (gradrow != NULL)
535 comp_gradient(gradrow[j], &fftr, hp->rp->ron);
536 /* new column edge & paired triangle */
537 backg = back_ambval(hp, AI(hp,i+1,j+1),
538 AI(hp,i+1,j), AI(hp,i,j+1));
539 comp_fftri(&fftr, hp, AI(hp,i,j+1), AI(hp,i+1,j+1));
540 if (hessrow != NULL) {
541 comp_hessian(hesscol, &fftr, hp->rp->ron);
542 rev_hessian(hessdia);
543 add2hessian(hessian, hessrow[j], hessdia, hesscol, backg);
544 if (i < hp->ns-2)
545 rev_hessian(hessrow[j]);
546 }
547 if (gradrow != NULL) {
548 comp_gradient(gradcol, &fftr, hp->rp->ron);
549 rev_gradient(graddia);
550 add2gradient(gradient, gradrow[j], graddia, gradcol, backg);
551 if (i < hp->ns-2)
552 rev_gradient(gradrow[j]);
553 }
554 }
555 }
556 /* release row buffers */
557 if (hessrow != NULL) free(hessrow);
558 if (gradrow != NULL) free(gradrow);
559
560 if (ra != NULL) /* extract eigenvectors & radii */
561 eigenvectors(uv, ra, hessian);
562 if (pg != NULL) { /* tangential position gradient */
563 pg[0] = DOT(gradient, uv[0]);
564 pg[1] = DOT(gradient, uv[1]);
565 }
566 }
567
568
569 /* Compute direction gradient from a hemispherical sampling */
570 static void
571 ambdirgrad(AMBHEMI *hp, FVECT uv[2], float dg[2])
572 {
573 AMBSAMP *ap;
574 double dgsum[2];
575 int n;
576 FVECT vd;
577 double gfact;
578
579 dgsum[0] = dgsum[1] = 0.0; /* sum values times -tan(theta) */
580 for (ap = hp->sa, n = hp->ns*hp->ns; n--; ap++) {
581 /* use vector for azimuth + 90deg */
582 VSUB(vd, ap->p, hp->rp->rop);
583 /* brightness over cosine factor */
584 gfact = colval(ap->v,CIEY) / DOT(hp->rp->ron, vd);
585 /* sine = proj_radius/vd_length */
586 dgsum[0] -= DOT(uv[1], vd) * gfact;
587 dgsum[1] += DOT(uv[0], vd) * gfact;
588 }
589 dg[0] = dgsum[0] / (hp->ns*hp->ns);
590 dg[1] = dgsum[1] / (hp->ns*hp->ns);
591 }
592
593
594 /* Compute potential light leak direction flags for cache value */
595 static uint32
596 ambcorral(AMBHEMI *hp, FVECT uv[2], const double r0, const double r1)
597 {
598 const double max_d = 1.0/(minarad*ambacc + 0.001);
599 const double ang_res = 0.5*PI/(hp->ns-1);
600 const double ang_step = ang_res/((int)(16/PI*ang_res) + (1+FTINY));
601 double avg_d = 0;
602 uint32 flgs = 0;
603 FVECT vec;
604 double u, v;
605 double ang, a1;
606 int i, j;
607 /* don't bother for a few samples */
608 if (hp->ns < 12)
609 return(0);
610 /* check distances overhead */
611 for (i = hp->ns*3/4; i-- > hp->ns>>2; )
612 for (j = hp->ns*3/4; j-- > hp->ns>>2; )
613 avg_d += ambsam(hp,i,j).d;
614 avg_d *= 4.0/(hp->ns*hp->ns);
615 if (avg_d*r0 >= 1.0) /* ceiling too low for corral? */
616 return(0);
617 if (avg_d >= max_d) /* insurance */
618 return(0);
619 /* else circle around perimeter */
620 for (i = 0; i < hp->ns; i++)
621 for (j = 0; j < hp->ns; j += !i|(i==hp->ns-1) ? 1 : hp->ns-1) {
622 AMBSAMP *ap = &ambsam(hp,i,j);
623 if ((ap->d <= FTINY) | (ap->d >= max_d))
624 continue; /* too far or too near */
625 VSUB(vec, ap->p, hp->rp->rop);
626 u = DOT(vec, uv[0]) * ap->d;
627 v = DOT(vec, uv[1]) * ap->d;
628 if ((r0*r0*u*u + r1*r1*v*v) * ap->d*ap->d <= 1.0)
629 continue; /* occluder outside ellipse */
630 ang = atan2a(v, u); /* else set direction flags */
631 for (a1 = ang-.5*ang_res; a1 <= ang+.5*ang_res; a1 += ang_step)
632 flgs |= 1L<<(int)(16/PI*(a1 + 2.*PI*(a1 < 0)));
633 }
634 /* add low-angle incident (< 20deg) */
635 if (fabs(hp->rp->rod) <= 0.342) {
636 u = -DOT(hp->rp->rdir, uv[0]);
637 v = -DOT(hp->rp->rdir, uv[1]);
638 if ((r0*r0*u*u + r1*r1*v*v) > hp->rp->rot*hp->rp->rot) {
639 ang = atan2a(v, u);
640 ang += 2.*PI*(ang < 0);
641 ang *= 16/PI;
642 if ((ang < .5) | (ang >= 31.5))
643 flgs |= 0x80000001;
644 else
645 flgs |= 3L<<(int)(ang-.5);
646 }
647 }
648 return(flgs);
649 }
650
651
652 int
653 doambient( /* compute ambient component */
654 COLOR rcol, /* input/output color */
655 RAY *r,
656 double wt,
657 FVECT uv[2], /* returned (optional) */
658 float ra[2], /* returned (optional) */
659 float pg[2], /* returned (optional) */
660 float dg[2], /* returned (optional) */
661 uint32 *crlp /* returned (optional) */
662 )
663 {
664 AMBHEMI *hp = inithemi(rcol, r, wt);
665 int cnt;
666 FVECT my_uv[2];
667 double d, K, acol[3];
668 AMBSAMP *ap;
669 int i, j;
670 /* check/initialize */
671 if (hp == NULL)
672 return(0);
673 if (uv != NULL)
674 memset(uv, 0, sizeof(FVECT)*2);
675 if (ra != NULL)
676 ra[0] = ra[1] = 0.0;
677 if (pg != NULL)
678 pg[0] = pg[1] = 0.0;
679 if (dg != NULL)
680 dg[0] = dg[1] = 0.0;
681 if (crlp != NULL)
682 *crlp = 0;
683 /* sample the hemisphere */
684 acol[0] = acol[1] = acol[2] = 0.0;
685 cnt = 0;
686 for (i = hp->ns; i--; )
687 for (j = hp->ns; j--; )
688 if ((ap = ambsample(hp, i, j)) != NULL) {
689 addcolor(acol, ap->v);
690 ++cnt;
691 }
692 if (!cnt) {
693 setcolor(rcol, 0.0, 0.0, 0.0);
694 free(hp);
695 return(0); /* no valid samples */
696 }
697 if (cnt < hp->ns*hp->ns) { /* incomplete sampling? */
698 copycolor(rcol, acol);
699 free(hp);
700 return(-1); /* return value w/o Hessian */
701 }
702 cnt = ambssamp*wt + 0.5; /* perform super-sampling? */
703 if (cnt > 8)
704 ambsupersamp(acol, hp, cnt);
705 copycolor(rcol, acol); /* final indirect irradiance/PI */
706 if ((ra == NULL) & (pg == NULL) & (dg == NULL)) {
707 free(hp);
708 return(-1); /* no radius or gradient calc. */
709 }
710 if ((d = bright(acol)) > FTINY) { /* normalize Y values */
711 d = 0.99*(hp->ns*hp->ns)/d;
712 K = 0.01;
713 } else { /* or fall back on geometric Hessian */
714 K = 1.0;
715 pg = NULL;
716 dg = NULL;
717 crlp = NULL;
718 }
719 ap = hp->sa; /* relative Y channel from here on... */
720 for (i = hp->ns*hp->ns; i--; ap++)
721 colval(ap->v,CIEY) = bright(ap->v)*d + K;
722
723 if (uv == NULL) /* make sure we have axis pointers */
724 uv = my_uv;
725 /* compute radii & pos. gradient */
726 ambHessian(hp, uv, ra, pg);
727
728 if (dg != NULL) /* compute direction gradient */
729 ambdirgrad(hp, uv, dg);
730
731 if (ra != NULL) { /* scale/clamp radii */
732 if (pg != NULL) {
733 if (ra[0]*(d = fabs(pg[0])) > 1.0)
734 ra[0] = 1.0/d;
735 if (ra[1]*(d = fabs(pg[1])) > 1.0)
736 ra[1] = 1.0/d;
737 if (ra[0] > ra[1])
738 ra[0] = ra[1];
739 }
740 if (ra[0] < minarad) {
741 ra[0] = minarad;
742 if (ra[1] < minarad)
743 ra[1] = minarad;
744 }
745 ra[0] *= d = 1.0/sqrt(sqrt(wt));
746 if ((ra[1] *= d) > 2.0*ra[0])
747 ra[1] = 2.0*ra[0];
748 if (ra[1] > maxarad) {
749 ra[1] = maxarad;
750 if (ra[0] > maxarad)
751 ra[0] = maxarad;
752 }
753 /* flag encroached directions */
754 if ((wt >= 0.89*AVGREFL) & (crlp != NULL))
755 *crlp = ambcorral(hp, uv, ra[0]*ambacc, ra[1]*ambacc);
756 if (pg != NULL) { /* cap gradient if necessary */
757 d = pg[0]*pg[0]*ra[0]*ra[0] + pg[1]*pg[1]*ra[1]*ra[1];
758 if (d > 1.0) {
759 d = 1.0/sqrt(d);
760 pg[0] *= d;
761 pg[1] *= d;
762 }
763 }
764 }
765 free(hp); /* clean up and return */
766 return(1);
767 }
768
769
770 #else /* ! NEWAMB */
771
772
773 void
774 inithemi( /* initialize sampling hemisphere */
775 AMBHEMI *hp,
776 COLOR ac,
777 RAY *r,
778 double wt
779 )
780 {
781 double d;
782 int i;
783 /* set number of divisions */
784 if (ambacc <= FTINY &&
785 wt > (d = 0.8*intens(ac)*r->rweight/(ambdiv*minweight)))
786 wt = d; /* avoid ray termination */
787 hp->nt = sqrt(ambdiv * wt / PI) + 0.5;
788 i = ambacc > FTINY ? 3 : 1; /* minimum number of samples */
789 if (hp->nt < i)
790 hp->nt = i;
791 hp->np = PI * hp->nt + 0.5;
792 /* set number of super-samples */
793 hp->ns = ambssamp * wt + 0.5;
794 /* assign coefficient */
795 copycolor(hp->acoef, ac);
796 d = 1.0/(hp->nt*hp->np);
797 scalecolor(hp->acoef, d);
798 /* make axes */
799 VCOPY(hp->uz, r->ron);
800 hp->uy[0] = hp->uy[1] = hp->uy[2] = 0.0;
801 for (i = 0; i < 3; i++)
802 if (hp->uz[i] < 0.6 && hp->uz[i] > -0.6)
803 break;
804 if (i >= 3)
805 error(CONSISTENCY, "bad ray direction in inithemi");
806 hp->uy[i] = 1.0;
807 fcross(hp->ux, hp->uy, hp->uz);
808 normalize(hp->ux);
809 fcross(hp->uy, hp->uz, hp->ux);
810 }
811
812
813 int
814 divsample( /* sample a division */
815 AMBSAMP *dp,
816 AMBHEMI *h,
817 RAY *r
818 )
819 {
820 RAY ar;
821 int hlist[3];
822 double spt[2];
823 double xd, yd, zd;
824 double b2;
825 double phi;
826 int i;
827 /* ambient coefficient for weight */
828 if (ambacc > FTINY)
829 setcolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL);
830 else
831 copycolor(ar.rcoef, h->acoef);
832 if (rayorigin(&ar, AMBIENT, r, ar.rcoef) < 0)
833 return(-1);
834 if (ambacc > FTINY) {
835 multcolor(ar.rcoef, h->acoef);
836 scalecolor(ar.rcoef, 1./AVGREFL);
837 }
838 hlist[0] = r->rno;
839 hlist[1] = dp->t;
840 hlist[2] = dp->p;
841 multisamp(spt, 2, urand(ilhash(hlist,3)+dp->n));
842 zd = sqrt((dp->t + spt[0])/h->nt);
843 phi = 2.0*PI * (dp->p + spt[1])/h->np;
844 xd = tcos(phi) * zd;
845 yd = tsin(phi) * zd;
846 zd = sqrt(1.0 - zd*zd);
847 for (i = 0; i < 3; i++)
848 ar.rdir[i] = xd*h->ux[i] +
849 yd*h->uy[i] +
850 zd*h->uz[i];
851 checknorm(ar.rdir);
852 dimlist[ndims++] = dp->t*h->np + dp->p + 90171;
853 rayvalue(&ar);
854 ndims--;
855 multcolor(ar.rcol, ar.rcoef); /* apply coefficient */
856 addcolor(dp->v, ar.rcol);
857 /* use rt to improve gradient calc */
858 if (ar.rt > FTINY && ar.rt < FHUGE)
859 dp->r += 1.0/ar.rt;
860 /* (re)initialize error */
861 if (dp->n++) {
862 b2 = bright(dp->v)/dp->n - bright(ar.rcol);
863 b2 = b2*b2 + dp->k*((dp->n-1)*(dp->n-1));
864 dp->k = b2/(dp->n*dp->n);
865 } else
866 dp->k = 0.0;
867 return(0);
868 }
869
870
871 static int
872 ambcmp( /* decreasing order */
873 const void *p1,
874 const void *p2
875 )
876 {
877 const AMBSAMP *d1 = (const AMBSAMP *)p1;
878 const AMBSAMP *d2 = (const AMBSAMP *)p2;
879
880 if (d1->k < d2->k)
881 return(1);
882 if (d1->k > d2->k)
883 return(-1);
884 return(0);
885 }
886
887
888 static int
889 ambnorm( /* standard order */
890 const void *p1,
891 const void *p2
892 )
893 {
894 const AMBSAMP *d1 = (const AMBSAMP *)p1;
895 const AMBSAMP *d2 = (const AMBSAMP *)p2;
896 int c;
897
898 if ( (c = d1->t - d2->t) )
899 return(c);
900 return(d1->p - d2->p);
901 }
902
903
904 double
905 doambient( /* compute ambient component */
906 COLOR rcol,
907 RAY *r,
908 double wt,
909 FVECT pg,
910 FVECT dg
911 )
912 {
913 double b, d=0;
914 AMBHEMI hemi;
915 AMBSAMP *div;
916 AMBSAMP dnew;
917 double acol[3];
918 AMBSAMP *dp;
919 double arad;
920 int divcnt;
921 int i, j;
922 /* initialize hemisphere */
923 inithemi(&hemi, rcol, r, wt);
924 divcnt = hemi.nt * hemi.np;
925 /* initialize */
926 if (pg != NULL)
927 pg[0] = pg[1] = pg[2] = 0.0;
928 if (dg != NULL)
929 dg[0] = dg[1] = dg[2] = 0.0;
930 setcolor(rcol, 0.0, 0.0, 0.0);
931 if (divcnt == 0)
932 return(0.0);
933 /* allocate super-samples */
934 if (hemi.ns > 0 || pg != NULL || dg != NULL) {
935 div = (AMBSAMP *)malloc(divcnt*sizeof(AMBSAMP));
936 if (div == NULL)
937 error(SYSTEM, "out of memory in doambient");
938 } else
939 div = NULL;
940 /* sample the divisions */
941 arad = 0.0;
942 acol[0] = acol[1] = acol[2] = 0.0;
943 if ((dp = div) == NULL)
944 dp = &dnew;
945 divcnt = 0;
946 for (i = 0; i < hemi.nt; i++)
947 for (j = 0; j < hemi.np; j++) {
948 dp->t = i; dp->p = j;
949 setcolor(dp->v, 0.0, 0.0, 0.0);
950 dp->r = 0.0;
951 dp->n = 0;
952 if (divsample(dp, &hemi, r) < 0) {
953 if (div != NULL)
954 dp++;
955 continue;
956 }
957 arad += dp->r;
958 divcnt++;
959 if (div != NULL)
960 dp++;
961 else
962 addcolor(acol, dp->v);
963 }
964 if (!divcnt) {
965 if (div != NULL)
966 free((void *)div);
967 return(0.0); /* no samples taken */
968 }
969 if (divcnt < hemi.nt*hemi.np) {
970 pg = dg = NULL; /* incomplete sampling */
971 hemi.ns = 0;
972 } else if (arad > FTINY && divcnt/arad < minarad) {
973 hemi.ns = 0; /* close enough */
974 } else if (hemi.ns > 0) { /* else perform super-sampling? */
975 comperrs(div, &hemi); /* compute errors */
976 qsort(div, divcnt, sizeof(AMBSAMP), ambcmp); /* sort divs */
977 /* super-sample */
978 for (i = hemi.ns; i > 0; i--) {
979 dnew = *div;
980 if (divsample(&dnew, &hemi, r) < 0) {
981 dp++;
982 continue;
983 }
984 dp = div; /* reinsert */
985 j = divcnt < i ? divcnt : i;
986 while (--j > 0 && dnew.k < dp[1].k) {
987 *dp = *(dp+1);
988 dp++;
989 }
990 *dp = dnew;
991 }
992 if (pg != NULL || dg != NULL) /* restore order */
993 qsort(div, divcnt, sizeof(AMBSAMP), ambnorm);
994 }
995 /* compute returned values */
996 if (div != NULL) {
997 arad = 0.0; /* note: divcnt may be < nt*np */
998 for (i = hemi.nt*hemi.np, dp = div; i-- > 0; dp++) {
999 arad += dp->r;
1000 if (dp->n > 1) {
1001 b = 1.0/dp->n;
1002 scalecolor(dp->v, b);
1003 dp->r *= b;
1004 dp->n = 1;
1005 }
1006 addcolor(acol, dp->v);
1007 }
1008 b = bright(acol);
1009 if (b > FTINY) {
1010 b = 1.0/b; /* compute & normalize gradient(s) */
1011 if (pg != NULL) {
1012 posgradient(pg, div, &hemi);
1013 for (i = 0; i < 3; i++)
1014 pg[i] *= b;
1015 }
1016 if (dg != NULL) {
1017 dirgradient(dg, div, &hemi);
1018 for (i = 0; i < 3; i++)
1019 dg[i] *= b;
1020 }
1021 }
1022 free((void *)div);
1023 }
1024 copycolor(rcol, acol);
1025 if (arad <= FTINY)
1026 arad = maxarad;
1027 else
1028 arad = (divcnt+hemi.ns)/arad;
1029 if (pg != NULL) { /* reduce radius if gradient large */
1030 d = DOT(pg,pg);
1031 if (d*arad*arad > 1.0)
1032 arad = 1.0/sqrt(d);
1033 }
1034 if (arad < minarad) {
1035 arad = minarad;
1036 if (pg != NULL && d*arad*arad > 1.0) { /* cap gradient */
1037 d = 1.0/arad/sqrt(d);
1038 for (i = 0; i < 3; i++)
1039 pg[i] *= d;
1040 }
1041 }
1042 if ((arad /= sqrt(wt)) > maxarad)
1043 arad = maxarad;
1044 return(arad);
1045 }
1046
1047
1048 void
1049 comperrs( /* compute initial error estimates */
1050 AMBSAMP *da, /* assumes standard ordering */
1051 AMBHEMI *hp
1052 )
1053 {
1054 double b, b2;
1055 int i, j;
1056 AMBSAMP *dp;
1057 /* sum differences from neighbors */
1058 dp = da;
1059 for (i = 0; i < hp->nt; i++)
1060 for (j = 0; j < hp->np; j++) {
1061 #ifdef DEBUG
1062 if (dp->t != i || dp->p != j)
1063 error(CONSISTENCY,
1064 "division order in comperrs");
1065 #endif
1066 b = bright(dp[0].v);
1067 if (i > 0) { /* from above */
1068 b2 = bright(dp[-hp->np].v) - b;
1069 b2 *= b2 * 0.25;
1070 dp[0].k += b2;
1071 dp[-hp->np].k += b2;
1072 }
1073 if (j > 0) { /* from behind */
1074 b2 = bright(dp[-1].v) - b;
1075 b2 *= b2 * 0.25;
1076 dp[0].k += b2;
1077 dp[-1].k += b2;
1078 } else { /* around */
1079 b2 = bright(dp[hp->np-1].v) - b;
1080 b2 *= b2 * 0.25;
1081 dp[0].k += b2;
1082 dp[hp->np-1].k += b2;
1083 }
1084 dp++;
1085 }
1086 /* divide by number of neighbors */
1087 dp = da;
1088 for (j = 0; j < hp->np; j++) /* top row */
1089 (dp++)->k *= 1.0/3.0;
1090 if (hp->nt < 2)
1091 return;
1092 for (i = 1; i < hp->nt-1; i++) /* central region */
1093 for (j = 0; j < hp->np; j++)
1094 (dp++)->k *= 0.25;
1095 for (j = 0; j < hp->np; j++) /* bottom row */
1096 (dp++)->k *= 1.0/3.0;
1097 }
1098
1099
1100 void
1101 posgradient( /* compute position gradient */
1102 FVECT gv,
1103 AMBSAMP *da, /* assumes standard ordering */
1104 AMBHEMI *hp
1105 )
1106 {
1107 int i, j;
1108 double nextsine, lastsine, b, d;
1109 double mag0, mag1;
1110 double phi, cosp, sinp, xd, yd;
1111 AMBSAMP *dp;
1112
1113 xd = yd = 0.0;
1114 for (j = 0; j < hp->np; j++) {
1115 dp = da + j;
1116 mag0 = mag1 = 0.0;
1117 lastsine = 0.0;
1118 for (i = 0; i < hp->nt; i++) {
1119 #ifdef DEBUG
1120 if (dp->t != i || dp->p != j)
1121 error(CONSISTENCY,
1122 "division order in posgradient");
1123 #endif
1124 b = bright(dp->v);
1125 if (i > 0) {
1126 d = dp[-hp->np].r;
1127 if (dp[0].r > d) d = dp[0].r;
1128 /* sin(t)*cos(t)^2 */
1129 d *= lastsine * (1.0 - (double)i/hp->nt);
1130 mag0 += d*(b - bright(dp[-hp->np].v));
1131 }
1132 nextsine = sqrt((double)(i+1)/hp->nt);
1133 if (j > 0) {
1134 d = dp[-1].r;
1135 if (dp[0].r > d) d = dp[0].r;
1136 mag1 += d * (nextsine - lastsine) *
1137 (b - bright(dp[-1].v));
1138 } else {
1139 d = dp[hp->np-1].r;
1140 if (dp[0].r > d) d = dp[0].r;
1141 mag1 += d * (nextsine - lastsine) *
1142 (b - bright(dp[hp->np-1].v));
1143 }
1144 dp += hp->np;
1145 lastsine = nextsine;
1146 }
1147 mag0 *= 2.0*PI / hp->np;
1148 phi = 2.0*PI * (double)j/hp->np;
1149 cosp = tcos(phi); sinp = tsin(phi);
1150 xd += mag0*cosp - mag1*sinp;
1151 yd += mag0*sinp + mag1*cosp;
1152 }
1153 for (i = 0; i < 3; i++)
1154 gv[i] = (xd*hp->ux[i] + yd*hp->uy[i])*(hp->nt*hp->np)/PI;
1155 }
1156
1157
1158 void
1159 dirgradient( /* compute direction gradient */
1160 FVECT gv,
1161 AMBSAMP *da, /* assumes standard ordering */
1162 AMBHEMI *hp
1163 )
1164 {
1165 int i, j;
1166 double mag;
1167 double phi, xd, yd;
1168 AMBSAMP *dp;
1169
1170 xd = yd = 0.0;
1171 for (j = 0; j < hp->np; j++) {
1172 dp = da + j;
1173 mag = 0.0;
1174 for (i = 0; i < hp->nt; i++) {
1175 #ifdef DEBUG
1176 if (dp->t != i || dp->p != j)
1177 error(CONSISTENCY,
1178 "division order in dirgradient");
1179 #endif
1180 /* tan(t) */
1181 mag += bright(dp->v)/sqrt(hp->nt/(i+.5) - 1.0);
1182 dp += hp->np;
1183 }
1184 phi = 2.0*PI * (j+.5)/hp->np + PI/2.0;
1185 xd += mag * tcos(phi);
1186 yd += mag * tsin(phi);
1187 }
1188 for (i = 0; i < 3; i++)
1189 gv[i] = xd*hp->ux[i] + yd*hp->uy[i];
1190 }
1191
1192 #endif /* ! NEWAMB */