| 1 |
< |
/* Copyright (c) 1986 Regents of the University of California */ |
| 1 |
> |
/* Copyright (c) 1991 Regents of the University of California */ |
| 2 |
|
|
| 3 |
|
#ifndef lint |
| 4 |
|
static char SCCSid[] = "$SunId$ LBL"; |
| 19 |
|
|
| 20 |
|
#include "otypes.h" |
| 21 |
|
|
| 22 |
+ |
#include "ambient.h" |
| 23 |
+ |
|
| 24 |
|
#include "random.h" |
| 25 |
|
|
| 26 |
|
#define OCTSCALE 0.5 /* ceil((valid rad.)/(cube size)) */ |
| 27 |
|
|
| 28 |
+ |
typedef struct ambtree { |
| 29 |
+ |
AMBVAL *alist; /* ambient value list */ |
| 30 |
+ |
struct ambtree *kid; /* 8 child nodes */ |
| 31 |
+ |
} AMBTREE; /* ambient octree */ |
| 32 |
+ |
|
| 33 |
|
extern CUBE thescene; /* contains space boundaries */ |
| 34 |
|
|
| 28 |
– |
extern COLOR ambval; /* global ambient component */ |
| 29 |
– |
extern double ambacc; /* ambient accuracy */ |
| 30 |
– |
extern int ambres; /* ambient resolution */ |
| 31 |
– |
extern int ambdiv; /* number of divisions for calculation */ |
| 32 |
– |
extern int ambssamp; /* number of super-samples */ |
| 33 |
– |
extern int ambounce; /* number of ambient bounces */ |
| 34 |
– |
extern char *amblist[]; /* ambient include/exclude list */ |
| 35 |
– |
extern int ambincl; /* include == 1, exclude == 0 */ |
| 36 |
– |
|
| 35 |
|
#define MAXASET 511 /* maximum number of elements in ambient set */ |
| 36 |
|
OBJECT ambset[MAXASET+1]={0}; /* ambient include/exclude set */ |
| 37 |
|
|
| 38 |
|
double maxarad; /* maximum ambient radius */ |
| 39 |
|
double minarad; /* minimum ambient radius */ |
| 40 |
|
|
| 43 |
– |
typedef struct ambval { |
| 44 |
– |
FVECT pos; /* position in space */ |
| 45 |
– |
FVECT dir; /* normal direction */ |
| 46 |
– |
int lvl; /* recursion level of parent ray */ |
| 47 |
– |
float weight; /* weight of parent ray */ |
| 48 |
– |
COLOR val; /* computed ambient value */ |
| 49 |
– |
float rad; /* validity radius */ |
| 50 |
– |
struct ambval *next; /* next in list */ |
| 51 |
– |
} AMBVAL; /* ambient value */ |
| 52 |
– |
|
| 53 |
– |
typedef struct ambtree { |
| 54 |
– |
AMBVAL *alist; /* ambient value list */ |
| 55 |
– |
struct ambtree *kid; /* 8 child nodes */ |
| 56 |
– |
} AMBTREE; /* ambient octree */ |
| 57 |
– |
|
| 58 |
– |
typedef struct { |
| 59 |
– |
float k; /* error contribution per sample */ |
| 60 |
– |
COLOR v; /* ray sum */ |
| 61 |
– |
int n; /* number of samples */ |
| 62 |
– |
short t, p; /* theta, phi indices */ |
| 63 |
– |
} AMBSAMP; /* ambient sample */ |
| 64 |
– |
|
| 41 |
|
static AMBTREE atrunk; /* our ambient trunk node */ |
| 42 |
|
|
| 43 |
|
static FILE *ambfp = NULL; /* ambient file pointer */ |
| 46 |
|
|
| 47 |
|
#define newambtree() (AMBTREE *)calloc(8, sizeof(AMBTREE)) |
| 48 |
|
|
| 73 |
– |
double sumambient(), doambient(), makeambient(); |
| 49 |
|
|
| 75 |
– |
|
| 50 |
|
setambient(afile) /* initialize calculation */ |
| 51 |
|
char *afile; |
| 52 |
|
{ |
| 115 |
|
goto dumbamb; |
| 116 |
|
|
| 117 |
|
if (ambacc <= FTINY) { /* no ambient storage */ |
| 118 |
< |
if (doambient(acol, r) == 0.0) |
| 118 |
> |
if (doambient(acol, r, NULL, NULL) == 0.0) |
| 119 |
|
goto dumbamb; |
| 120 |
|
goto done; |
| 121 |
|
} |
| 183 |
|
for (j = 0; j < 3; j++) |
| 184 |
|
d += (r->rop[j] - av->pos[j]) * |
| 185 |
|
(av->dir[j] + r->ron[j]); |
| 186 |
< |
if (d < -minarad) |
| 186 |
> |
if (d*0.5 < -minarad*ambacc) |
| 187 |
|
continue; |
| 188 |
|
/* |
| 189 |
|
* Jittering final test reduces image artifacts. |
| 228 |
|
register RAY *r; |
| 229 |
|
{ |
| 230 |
|
AMBVAL amb; |
| 231 |
+ |
FVECT gp, gd; |
| 232 |
|
|
| 233 |
< |
amb.rad = doambient(acol, r); /* compute ambient */ |
| 233 |
> |
amb.rad = doambient(acol, r, gp, gd); /* compute ambient */ |
| 234 |
|
if (amb.rad == 0.0) |
| 235 |
|
return(0.0); |
| 236 |
|
/* store it */ |
| 239 |
|
amb.lvl = r->rlvl; |
| 240 |
|
amb.weight = r->rweight; |
| 241 |
|
copycolor(amb.val, acol); |
| 242 |
+ |
VCOPY(amb.gpos, gp); |
| 243 |
+ |
VCOPY(amb.gdir, gd); |
| 244 |
|
/* insert into tree */ |
| 245 |
|
avinsert(&amb, &atrunk, thescene.cuorg, thescene.cusize); |
| 246 |
|
avsave(&amb); /* write to file */ |
| 247 |
|
return(amb.rad); |
| 271 |
– |
} |
| 272 |
– |
|
| 273 |
– |
|
| 274 |
– |
double |
| 275 |
– |
doambient(acol, r) /* compute ambient component */ |
| 276 |
– |
COLOR acol; |
| 277 |
– |
register RAY *r; |
| 278 |
– |
{ |
| 279 |
– |
extern int ambcmp(); |
| 280 |
– |
extern double sin(), cos(), sqrt(); |
| 281 |
– |
int hlist[4]; |
| 282 |
– |
double phi, xd, yd, zd; |
| 283 |
– |
double b, b2; |
| 284 |
– |
register AMBSAMP *div; |
| 285 |
– |
AMBSAMP dnew; |
| 286 |
– |
RAY ar; |
| 287 |
– |
FVECT ux, uy; |
| 288 |
– |
double arad; |
| 289 |
– |
int ndivs, nt, np, ns, ne, i, j; |
| 290 |
– |
register int k; |
| 291 |
– |
|
| 292 |
– |
setcolor(acol, 0.0, 0.0, 0.0); |
| 293 |
– |
/* set number of divisions */ |
| 294 |
– |
nt = sqrt(ambdiv * r->rweight * 0.5) + 0.5; |
| 295 |
– |
np = 2 * nt; |
| 296 |
– |
ndivs = nt * np; |
| 297 |
– |
/* check first */ |
| 298 |
– |
if (ndivs == 0 || rayorigin(&ar, r, AMBIENT, 0.5) < 0) |
| 299 |
– |
return(0.0); |
| 300 |
– |
/* set number of super-samples */ |
| 301 |
– |
ns = ambssamp * r->rweight + 0.5; |
| 302 |
– |
if (ns > 0) { |
| 303 |
– |
div = (AMBSAMP *)malloc(ndivs*sizeof(AMBSAMP)); |
| 304 |
– |
if (div == NULL) |
| 305 |
– |
error(SYSTEM, "out of memory in doambient"); |
| 306 |
– |
} |
| 307 |
– |
/* make axes */ |
| 308 |
– |
uy[0] = uy[1] = uy[2] = 0.0; |
| 309 |
– |
for (k = 0; k < 3; k++) |
| 310 |
– |
if (r->ron[k] < 0.6 && r->ron[k] > -0.6) |
| 311 |
– |
break; |
| 312 |
– |
uy[k] = 1.0; |
| 313 |
– |
fcross(ux, r->ron, uy); |
| 314 |
– |
normalize(ux); |
| 315 |
– |
fcross(uy, ux, r->ron); |
| 316 |
– |
/* set up urand */ |
| 317 |
– |
hlist[0] = r->rno; |
| 318 |
– |
/* sample divisions */ |
| 319 |
– |
arad = 0.0; |
| 320 |
– |
ne = 0; |
| 321 |
– |
for (i = 0; i < nt; i++) { |
| 322 |
– |
hlist[1] = i; |
| 323 |
– |
for (j = 0; j < np; j++) { |
| 324 |
– |
rayorigin(&ar, r, AMBIENT, 0.5); /* pretested */ |
| 325 |
– |
hlist[2] = j; |
| 326 |
– |
hlist[3] = 0; |
| 327 |
– |
zd = sqrt((i+urand(ilhash(hlist,4)))/nt); |
| 328 |
– |
hlist[3] = 1; |
| 329 |
– |
phi = 2.0*PI * (j+urand(ilhash(hlist,4)))/np; |
| 330 |
– |
xd = cos(phi) * zd; |
| 331 |
– |
yd = sin(phi) * zd; |
| 332 |
– |
zd = sqrt(1.0 - zd*zd); |
| 333 |
– |
for (k = 0; k < 3; k++) |
| 334 |
– |
ar.rdir[k] = xd*ux[k]+yd*uy[k]+zd*r->ron[k]; |
| 335 |
– |
dimlist[ndims++] = i*np + j + 38813; |
| 336 |
– |
rayvalue(&ar); |
| 337 |
– |
ndims--; |
| 338 |
– |
if (ar.rot < FHUGE) |
| 339 |
– |
arad += 1.0 / ar.rot; |
| 340 |
– |
if (ns > 0) { /* save division */ |
| 341 |
– |
div[ne].k = 0.0; |
| 342 |
– |
copycolor(div[ne].v, ar.rcol); |
| 343 |
– |
div[ne].n = 0; |
| 344 |
– |
div[ne].t = i; div[ne].p = j; |
| 345 |
– |
/* sum errors */ |
| 346 |
– |
b = bright(ar.rcol); |
| 347 |
– |
if (i > 0) { /* from above */ |
| 348 |
– |
b2 = bright(div[ne-np].v) - b; |
| 349 |
– |
b2 *= b2 * 0.25; |
| 350 |
– |
div[ne].k += b2; |
| 351 |
– |
div[ne].n++; |
| 352 |
– |
div[ne-np].k += b2; |
| 353 |
– |
div[ne-np].n++; |
| 354 |
– |
} |
| 355 |
– |
if (j > 0) { /* from behind */ |
| 356 |
– |
b2 = bright(div[ne-1].v) - b; |
| 357 |
– |
b2 *= b2 * 0.25; |
| 358 |
– |
div[ne].k += b2; |
| 359 |
– |
div[ne].n++; |
| 360 |
– |
div[ne-1].k += b2; |
| 361 |
– |
div[ne-1].n++; |
| 362 |
– |
} |
| 363 |
– |
if (j == np-1) { /* around */ |
| 364 |
– |
b2 = bright(div[ne-(np-1)].v) - b; |
| 365 |
– |
b2 *= b2 * 0.25; |
| 366 |
– |
div[ne].k += b2; |
| 367 |
– |
div[ne].n++; |
| 368 |
– |
div[ne-(np-1)].k += b2; |
| 369 |
– |
div[ne-(np-1)].n++; |
| 370 |
– |
} |
| 371 |
– |
ne++; |
| 372 |
– |
} else |
| 373 |
– |
addcolor(acol, ar.rcol); |
| 374 |
– |
} |
| 375 |
– |
} |
| 376 |
– |
for (k = 0; k < ne; k++) { /* compute errors */ |
| 377 |
– |
if (div[k].n > 1) |
| 378 |
– |
div[k].k /= div[k].n; |
| 379 |
– |
div[k].n = 1; |
| 380 |
– |
} |
| 381 |
– |
/* sort the divisions */ |
| 382 |
– |
qsort(div, ne, sizeof(AMBSAMP), ambcmp); |
| 383 |
– |
/* skim excess */ |
| 384 |
– |
while (ne > ns) { |
| 385 |
– |
ne--; |
| 386 |
– |
addcolor(acol, div[ne].v); |
| 387 |
– |
} |
| 388 |
– |
/* super-sample */ |
| 389 |
– |
for (i = ns; i > 0; i--) { |
| 390 |
– |
rayorigin(&ar, r, AMBIENT, 0.5); /* pretested */ |
| 391 |
– |
hlist[1] = div[0].t; |
| 392 |
– |
hlist[2] = div[0].p; |
| 393 |
– |
hlist[3] = 0; |
| 394 |
– |
zd = sqrt((div[0].t+urand(ilhash(hlist,4)+div[0].n))/nt); |
| 395 |
– |
hlist[3] = 1; |
| 396 |
– |
phi = 2.0*PI * (div[0].p+urand(ilhash(hlist,4)+div[0].n))/np; |
| 397 |
– |
xd = cos(phi) * zd; |
| 398 |
– |
yd = sin(phi) * zd; |
| 399 |
– |
zd = sqrt(1.0 - zd*zd); |
| 400 |
– |
for (k = 0; k < 3; k++) |
| 401 |
– |
ar.rdir[k] = xd*ux[k]+yd*uy[k]+zd*r->ron[k]; |
| 402 |
– |
dimlist[ndims++] = div[0].t*np + div[0].p + 38813; |
| 403 |
– |
rayvalue(&ar); |
| 404 |
– |
ndims--; |
| 405 |
– |
rayvalue(&ar); |
| 406 |
– |
if (ar.rot < FHUGE) |
| 407 |
– |
arad += 1.0 / ar.rot; |
| 408 |
– |
/* recompute error */ |
| 409 |
– |
copycolor(dnew.v, div[0].v); |
| 410 |
– |
addcolor(dnew.v, ar.rcol); |
| 411 |
– |
dnew.n = div[0].n + 1; |
| 412 |
– |
dnew.t = div[0].t; dnew.p = div[0].p; |
| 413 |
– |
b2 = bright(dnew.v)/dnew.n - bright(ar.rcol); |
| 414 |
– |
b2 = b2*b2 + div[0].k*(div[0].n*div[0].n); |
| 415 |
– |
dnew.k = b2/(dnew.n*dnew.n); |
| 416 |
– |
/* reinsert */ |
| 417 |
– |
for (k = 0; k < ne-1 && dnew.k < div[k+1].k; k++) |
| 418 |
– |
copystruct(&div[k], &div[k+1]); |
| 419 |
– |
copystruct(&div[k], &dnew); |
| 420 |
– |
|
| 421 |
– |
if (ne >= i) { /* extract darkest division */ |
| 422 |
– |
ne--; |
| 423 |
– |
if (div[ne].n > 1) |
| 424 |
– |
scalecolor(div[ne].v, 1.0/div[ne].n); |
| 425 |
– |
addcolor(acol, div[ne].v); |
| 426 |
– |
} |
| 427 |
– |
} |
| 428 |
– |
scalecolor(acol, 1.0/ndivs); |
| 429 |
– |
if (arad <= FTINY) |
| 430 |
– |
arad = FHUGE; |
| 431 |
– |
else |
| 432 |
– |
arad = (ndivs+ns) / arad / sqrt(r->rweight); |
| 433 |
– |
if (arad > maxarad) |
| 434 |
– |
arad = maxarad; |
| 435 |
– |
else if (arad < minarad) |
| 436 |
– |
arad = minarad; |
| 437 |
– |
if (ns > 0) |
| 438 |
– |
free((char *)div); |
| 439 |
– |
return(arad); |
| 440 |
– |
} |
| 441 |
– |
|
| 442 |
– |
|
| 443 |
– |
static int |
| 444 |
– |
ambcmp(d1, d2) /* decreasing order */ |
| 445 |
– |
AMBSAMP *d1, *d2; |
| 446 |
– |
{ |
| 447 |
– |
if (d1->k < d2->k) |
| 448 |
– |
return(1); |
| 449 |
– |
if (d1->k > d2->k) |
| 450 |
– |
return(-1); |
| 451 |
– |
return(0); |
| 248 |
|
} |
| 249 |
|
|
| 250 |
|
|
