10 |
|
* |
11 |
|
*/ |
12 |
|
|
13 |
+ |
#define _USE_MATH_DEFINES |
14 |
|
#include "rtio.h" |
15 |
|
#include <stdlib.h> |
16 |
|
#include <math.h> |
26 |
|
|
27 |
|
/* reference width maximum (1.0) */ |
28 |
|
static const unsigned iwbits = sizeof(unsigned)*4; |
29 |
< |
static const unsigned iwmax = (1<<(sizeof(unsigned)*4))-1; |
29 |
> |
static const unsigned iwmax = 1<<(sizeof(unsigned)*4); |
30 |
|
/* maximum cumulative value */ |
31 |
|
static const unsigned cumlmax = ~0; |
32 |
+ |
/* constant z-vector */ |
33 |
+ |
static const FVECT zvec = {.0, .0, 1.}; |
34 |
+ |
/* quantization value */ |
35 |
+ |
static double quantum = 1./256.; |
36 |
|
|
37 |
|
/* Struct used for our distribution-building callback */ |
38 |
|
typedef struct { |
96 |
|
return; |
97 |
|
for (n = (st->log2GR < 0) << st->ndim; n--; ) |
98 |
|
SDfreeTre(st->u.t[n]); |
99 |
< |
free((void *)st); |
99 |
> |
free(st); |
100 |
|
} |
101 |
|
|
102 |
|
/* Free a variable-resolution BSDF */ |
130 |
|
static float * |
131 |
|
grid_branch_start(SDNode *st, int n) |
132 |
|
{ |
133 |
< |
unsigned skipsiz = 1 << st->log2GR; |
133 |
> |
unsigned skipsiz = 1 << (st->log2GR - 1); |
134 |
|
float *vptr = st->u.v; |
135 |
|
int i; |
136 |
|
|
137 |
< |
for (i = 0; i < st->ndim; skipsiz <<= st->log2GR) |
138 |
< |
if (1<<i++ & n) |
139 |
< |
vptr += skipsiz >> 1; |
137 |
> |
for (i = st->ndim; i--; skipsiz <<= st->log2GR) |
138 |
> |
if (1<<i & n) |
139 |
> |
vptr += skipsiz; |
140 |
|
return vptr; |
141 |
|
} |
142 |
|
|
195 |
|
const unsigned skipsiz = 1 << --nd*shft; |
196 |
|
double sum = .0; |
197 |
|
int i; |
198 |
< |
|
198 |
> |
|
199 |
> |
va += *imin * skipsiz; |
200 |
> |
|
201 |
|
if (skipsiz == 1) |
202 |
|
for (i = *imin; i < *imax; i++) |
203 |
< |
sum += va[i]; |
203 |
> |
sum += *va++; |
204 |
|
else |
205 |
< |
for (i = *imin; i < *imax; i++) |
206 |
< |
sum += SDiterSum(va + i*skipsiz, nd, shft, imin+1, imax+1); |
205 |
> |
for (i = *imin; i < *imax; i++, va += skipsiz) |
206 |
> |
sum += SDiterSum(va, nd, shft, imin+1, imax+1); |
207 |
|
return sum; |
208 |
|
} |
209 |
|
|
211 |
|
static double |
212 |
|
SDavgTreBox(const SDNode *st, const double *bmin, const double *bmax) |
213 |
|
{ |
207 |
– |
int imin[SD_MAXDIM], imax[SD_MAXDIM]; |
214 |
|
unsigned n; |
215 |
|
int i; |
216 |
|
|
228 |
|
if (st->log2GR < 0) { /* iterate on subtree */ |
229 |
|
double sum = .0, wsum = 1e-20; |
230 |
|
double sbmin[SD_MAXDIM], sbmax[SD_MAXDIM], w; |
225 |
– |
|
231 |
|
for (n = 1 << st->ndim; n--; ) { |
232 |
|
w = 1.; |
233 |
|
for (i = st->ndim; i--; ) { |
251 |
|
} |
252 |
|
} |
253 |
|
return sum / wsum; |
254 |
+ |
} else { /* iterate over leaves */ |
255 |
+ |
int imin[SD_MAXDIM], imax[SD_MAXDIM]; |
256 |
+ |
|
257 |
+ |
n = 1; |
258 |
+ |
for (i = st->ndim; i--; ) { |
259 |
+ |
imin[i] = (bmin[i] <= 0) ? 0 : |
260 |
+ |
(int)((1 << st->log2GR)*bmin[i]); |
261 |
+ |
imax[i] = (bmax[i] >= 1.) ? (1 << st->log2GR) : |
262 |
+ |
(int)((1 << st->log2GR)*bmax[i] + .999999); |
263 |
+ |
n *= imax[i] - imin[i]; |
264 |
+ |
} |
265 |
+ |
if (n) |
266 |
+ |
return SDiterSum(st->u.v, st->ndim, |
267 |
+ |
st->log2GR, imin, imax) / (double)n; |
268 |
|
} |
269 |
< |
n = 1; /* iterate over leaves */ |
251 |
< |
for (i = st->ndim; i--; ) { |
252 |
< |
imin[i] = (bmin[i] <= 0) ? 0 |
253 |
< |
: (int)((1 << st->log2GR)*bmin[i]); |
254 |
< |
imax[i] = (bmax[i] >= 1.) ? (1 << st->log2GR) |
255 |
< |
: (int)((1 << st->log2GR)*bmax[i] + .999999); |
256 |
< |
n *= imax[i] - imin[i]; |
257 |
< |
} |
258 |
< |
if (!n) |
259 |
< |
return .0; |
260 |
< |
|
261 |
< |
return SDiterSum(st->u.v, st->ndim, st->log2GR, imin, imax) / (double)n; |
269 |
> |
return .0; |
270 |
|
} |
271 |
|
|
272 |
|
/* Recursive call for SDtraverseTre() */ |
327 |
|
clim[i][0] = 0; |
328 |
|
clim[i][1] = 1 << st->log2GR; |
329 |
|
} |
322 |
– |
/* fill in unused dimensions */ |
323 |
– |
for (i = SD_MAXDIM; i-- > st->ndim; ) { |
324 |
– |
clim[i][0] = 0; clim[i][1] = 1; |
325 |
– |
} |
330 |
|
#if (SD_MAXDIM == 4) |
331 |
|
bmin[0] = cmin[0] + csiz*clim[0][0]; |
332 |
|
for (cpos[0] = clim[0][0]; cpos[0] < clim[0][1]; cpos[0]++) { |
333 |
|
bmin[1] = cmin[1] + csiz*clim[1][0]; |
334 |
|
for (cpos[1] = clim[1][0]; cpos[1] < clim[1][1]; cpos[1]++) { |
335 |
|
bmin[2] = cmin[2] + csiz*clim[2][0]; |
336 |
< |
for (cpos[2] = clim[2][0]; cpos[2] < clim[2][1]; cpos[2]++) { |
337 |
< |
bmin[3] = cmin[3] + csiz*(cpos[3] = clim[3][0]); |
336 |
> |
if (st->ndim == 3) { |
337 |
> |
cpos[2] = clim[2][0]; |
338 |
|
n = cpos[0]; |
339 |
< |
for (i = 1; i < st->ndim; i++) |
339 |
> |
for (i = 1; i < 3; i++) |
340 |
|
n = (n << st->log2GR) + cpos[i]; |
341 |
< |
for ( ; cpos[3] < clim[3][1]; cpos[3]++) { |
341 |
> |
for ( ; cpos[2] < clim[2][1]; cpos[2]++) { |
342 |
|
rval += rv = (*cf)(st->u.v[n++], bmin, csiz, cptr); |
343 |
|
if (rv < 0) |
344 |
|
return rv; |
345 |
< |
bmin[3] += csiz; |
345 |
> |
bmin[2] += csiz; |
346 |
|
} |
347 |
< |
bmin[2] += csiz; |
347 |
> |
} else { |
348 |
> |
for (cpos[2] = clim[2][0]; cpos[2] < clim[2][1]; cpos[2]++) { |
349 |
> |
bmin[3] = cmin[3] + csiz*(cpos[3] = clim[3][0]); |
350 |
> |
n = cpos[0]; |
351 |
> |
for (i = 1; i < 4; i++) |
352 |
> |
n = (n << st->log2GR) + cpos[i]; |
353 |
> |
for ( ; cpos[3] < clim[3][1]; cpos[3]++) { |
354 |
> |
rval += rv = (*cf)(st->u.v[n++], bmin, csiz, cptr); |
355 |
> |
if (rv < 0) |
356 |
> |
return rv; |
357 |
> |
bmin[3] += csiz; |
358 |
> |
} |
359 |
> |
bmin[2] += csiz; |
360 |
> |
} |
361 |
|
} |
362 |
|
bmin[1] += csiz; |
363 |
|
} |
432 |
|
static float |
433 |
|
SDqueryTre(const SDTre *sdt, const FVECT outVec, const FVECT inVec, double *hc) |
434 |
|
{ |
418 |
– |
static const FVECT zvec = {.0, .0, 1.}; |
435 |
|
FVECT rOutVec; |
436 |
|
double gridPos[4]; |
437 |
|
|
453 |
|
} |
454 |
|
/* convert vector coordinates */ |
455 |
|
if (sdt->st->ndim == 3) { |
456 |
< |
spinvector(rOutVec, outVec, zvec, -atan2(inVec[1],inVec[0])); |
456 |
> |
spinvector(rOutVec, outVec, zvec, -atan2(-inVec[1],-inVec[0])); |
457 |
|
gridPos[0] = .5 - .5*sqrt(inVec[0]*inVec[0] + inVec[1]*inVec[1]); |
458 |
|
SDdisk2square(gridPos+1, rOutVec[0], rOutVec[1]); |
459 |
|
} else if (sdt->st->ndim == 4) { |
566 |
|
free(myScaffold.darr); |
567 |
|
return NULL; |
568 |
|
} |
569 |
+ |
cd->isodist = (myScaffold.nic == 1); |
570 |
|
/* sort the distribution */ |
571 |
|
qsort(myScaffold.darr, cd->calen = myScaffold.alen, |
572 |
|
sizeof(struct outdir_s), &sscmp); |
577 |
|
cd->clim[i][0] = floor(pos[i]/scale) * scale; |
578 |
|
cd->clim[i][1] = cd->clim[i][0] + scale; |
579 |
|
} |
580 |
+ |
if (cd->isodist) { /* avoid issue in SDqueryTreProjSA() */ |
581 |
+ |
cd->clim[1][0] = cd->clim[0][0]; |
582 |
+ |
cd->clim[1][1] = cd->clim[0][1]; |
583 |
+ |
} |
584 |
|
cd->max_psa = myScaffold.wmax / (double)iwmax; |
585 |
|
cd->max_psa *= cd->max_psa * M_PI; |
586 |
|
cd->sidef = sdt->sidef; |
610 |
|
{ |
611 |
|
const SDTre *sdt; |
612 |
|
double inCoord[2]; |
592 |
– |
int vflags; |
613 |
|
int i; |
614 |
|
SDTreCDst *cd, *cdlast; |
615 |
|
/* check arguments */ |
616 |
|
if ((inVec == NULL) | (sdc == NULL) || |
617 |
|
(sdt = (SDTre *)sdc->dist) == NULL) |
618 |
|
return NULL; |
619 |
< |
if (sdt->st->ndim == 3) /* isotropic BSDF? */ |
619 |
> |
if (sdt->st->ndim == 3) { /* isotropic BSDF? */ |
620 |
|
inCoord[0] = .5 - .5*sqrt(inVec[0]*inVec[0] + inVec[1]*inVec[1]); |
621 |
< |
else if (sdt->st->ndim == 4) |
621 |
> |
} else if (sdt->st->ndim == 4) { |
622 |
|
SDdisk2square(inCoord, -inVec[0], -inVec[1]); |
623 |
< |
else |
623 |
> |
} else |
624 |
|
return NULL; /* should be internal error */ |
625 |
+ |
/* quantize to avoid f.p. errors */ |
626 |
+ |
for (i = sdt->st->ndim - 2; i--; ) |
627 |
+ |
inCoord[i] = floor(inCoord[i]/quantum)*quantum + .5*quantum; |
628 |
|
cdlast = NULL; /* check for direction in cache list */ |
629 |
|
for (cd = (SDTreCDst *)sdc->cdList; cd != NULL; |
630 |
< |
cdlast = cd, cd = (SDTreCDst *)cd->next) { |
630 |
> |
cdlast = cd, cd = cd->next) { |
631 |
|
for (i = sdt->st->ndim - 2; i--; ) |
632 |
|
if ((cd->clim[i][0] > inCoord[i]) | |
633 |
|
(inCoord[i] >= cd->clim[i][1])) |
639 |
|
cdlast = cd = make_cdist(sdt, inCoord); |
640 |
|
if (cdlast != NULL) { /* move entry to head of cache list */ |
641 |
|
cdlast->next = cd->next; |
642 |
< |
cd->next = sdc->cdList; |
642 |
> |
cd->next = (SDTreCDst *)sdc->cdList; |
643 |
|
sdc->cdList = (SDCDst *)cd; |
644 |
|
} |
645 |
|
return (SDCDst *)cd; /* ready to go */ |
702 |
|
const SDTreCDst *cd = (const SDTreCDst *)cdp; |
703 |
|
const unsigned target = randX*cumlmax; |
704 |
|
bitmask_t hndx, hcoord[2]; |
705 |
< |
double gpos[3]; |
705 |
> |
double gpos[3], rotangle; |
706 |
|
int i, iupper, ilower; |
707 |
|
/* check arguments */ |
708 |
|
if ((ioVec == NULL) | (cd == NULL)) |
715 |
|
/* binary search to find position */ |
716 |
|
ilower = 0; iupper = cd->calen; |
717 |
|
while ((i = (iupper + ilower) >> 1) != ilower) |
718 |
< |
if ((long)target >= (long)cd->carr[i].cuml) |
718 |
> |
if (target >= cd->carr[i].cuml) |
719 |
|
ilower = i; |
720 |
|
else |
721 |
|
iupper = i; |
738 |
|
/* emit from back? */ |
739 |
|
if (ioVec[2] > 0 ^ cd->sidef != SD_XMIT) |
740 |
|
gpos[2] = -gpos[2]; |
741 |
< |
VCOPY(ioVec, gpos); |
741 |
> |
if (cd->isodist) { /* rotate isotropic result */ |
742 |
> |
rotangle = atan2(-ioVec[1],-ioVec[0]); |
743 |
> |
VCOPY(ioVec, gpos); |
744 |
> |
spinvector(ioVec, ioVec, zvec, rotangle); |
745 |
> |
} else |
746 |
> |
VCOPY(ioVec, gpos); |
747 |
|
return SDEnone; |
748 |
|
} |
749 |
|
|
813 |
|
} else { /* else load value grid */ |
814 |
|
int bsiz; |
815 |
|
n = count_values(*spp); /* see how big the grid is */ |
816 |
< |
for (bsiz = 0; bsiz < 8*sizeof(size_t)-1; bsiz += nd) |
816 |
> |
for (bsiz = 0; bsiz < 8*sizeof(size_t); bsiz += nd) |
817 |
|
if (1<<bsiz == n) |
818 |
|
break; |
819 |
|
if (bsiz >= 8*sizeof(size_t)) { |
846 |
|
double stepWidth, dhemi, bmin[4], bmax[4]; |
847 |
|
|
848 |
|
stepWidth = SDsmallestLeaf(st); |
849 |
+ |
if (quantum > stepWidth) /* adjust quantization factor */ |
850 |
+ |
quantum = stepWidth; |
851 |
|
df->minProjSA = M_PI*stepWidth*stepWidth; |
852 |
|
if (stepWidth < .03125) |
853 |
|
stepWidth = .03125; /* 1/32 resolution good enough */ |
887 |
|
SDSpectralDF *df; |
888 |
|
SDTre *sdt; |
889 |
|
char *sdata; |
860 |
– |
int i; |
890 |
|
/* allocate BSDF component */ |
891 |
|
sdata = ezxml_txt(ezxml_child(wdb, "WavelengthDataDirection")); |
892 |
|
if (!sdata) |
991 |
|
SDsubtractTreVal(st->u.t[n], val); |
992 |
|
} else { |
993 |
|
for (n = 1<<(st->ndim*st->log2GR); n--; ) |
994 |
< |
st->u.v[n] -= val; |
994 |
> |
if ((st->u.v[n] -= val) < 0) |
995 |
> |
st->u.v[n] = .0f; |
996 |
|
} |
997 |
|
} |
998 |
|
|
1006 |
|
int n; |
1007 |
|
vmin = 1./M_PI; |
1008 |
|
if (st->log2GR < 0) { |
1009 |
< |
for (n = 0; n < 4; n++) { |
1009 |
> |
for (n = 0; n < 8; n += 2) { |
1010 |
|
float v = SDgetTreMin(st->u.t[n]); |
1011 |
|
if (v < vmin) |
1012 |
|
vmin = v; |