| 21 |
|
#include "ambient.h" |
| 22 |
|
#include "random.h" |
| 23 |
|
|
| 24 |
< |
#ifdef NEWAMB |
| 24 |
> |
#ifndef MINADIV |
| 25 |
> |
#define MINADIV 7 /* minimum # divisions in each dimension */ |
| 26 |
> |
#endif |
| 27 |
> |
#ifndef MINSDIST |
| 28 |
> |
#define MINSDIST 0.25 /* def. min. spacing = 1/4th division */ |
| 29 |
> |
#endif |
| 30 |
|
|
| 26 |
– |
extern void SDsquare2disk(double ds[2], double seedx, double seedy); |
| 27 |
– |
|
| 28 |
– |
/* vertex direction bit positions */ |
| 29 |
– |
#define VDB_xy 0 |
| 30 |
– |
#define VDB_y 01 |
| 31 |
– |
#define VDB_x 02 |
| 32 |
– |
#define VDB_Xy 03 |
| 33 |
– |
#define VDB_xY 04 |
| 34 |
– |
#define VDB_X 05 |
| 35 |
– |
#define VDB_Y 06 |
| 36 |
– |
#define VDB_XY 07 |
| 37 |
– |
/* get opposite vertex direction bit */ |
| 38 |
– |
#define VDB_OPP(f) (~(f) & 07) |
| 39 |
– |
/* adjacent triangle vertex flags */ |
| 40 |
– |
static const int adjacent_trifl[8] = { |
| 41 |
– |
0, /* forbidden diagonal */ |
| 42 |
– |
1<<VDB_x|1<<VDB_y|1<<VDB_Xy, |
| 43 |
– |
1<<VDB_y|1<<VDB_x|1<<VDB_xY, |
| 44 |
– |
1<<VDB_y|1<<VDB_Xy|1<<VDB_X, |
| 45 |
– |
1<<VDB_x|1<<VDB_xY|1<<VDB_Y, |
| 46 |
– |
1<<VDB_Xy|1<<VDB_X|1<<VDB_Y, |
| 47 |
– |
1<<VDB_xY|1<<VDB_Y|1<<VDB_X, |
| 48 |
– |
0, /* forbidden diagonal */ |
| 49 |
– |
}; |
| 50 |
– |
|
| 31 |
|
typedef struct { |
| 52 |
– |
COLOR v; /* hemisphere sample value */ |
| 32 |
|
FVECT p; /* intersection point */ |
| 33 |
+ |
float d; /* reciprocal distance */ |
| 34 |
+ |
SCOLOR v; /* hemisphere sample value */ |
| 35 |
|
} AMBSAMP; /* sample value */ |
| 36 |
|
|
| 37 |
|
typedef struct { |
| 38 |
|
RAY *rp; /* originating ray sample */ |
| 58 |
– |
FVECT ux, uy; /* tangent axis unit vectors */ |
| 39 |
|
int ns; /* number of samples per axis */ |
| 40 |
< |
COLOR acoef; /* division contribution coefficient */ |
| 40 |
> |
int sampOK; /* acquired full sample set? */ |
| 41 |
> |
int atyp; /* RAMBIENT or TAMBIENT */ |
| 42 |
> |
SCOLOR acoef; /* division contribution coefficient */ |
| 43 |
> |
SCOLOR acol; /* accumulated color */ |
| 44 |
> |
FVECT onrm; /* oriented unperturbed surface normal */ |
| 45 |
> |
FVECT ux, uy; /* tangent axis unit vectors */ |
| 46 |
|
AMBSAMP sa[1]; /* sample array (extends struct) */ |
| 47 |
|
} AMBHEMI; /* ambient sample hemisphere */ |
| 48 |
|
|
| 49 |
< |
#define ambndx(h,i,j) ((i)*(h)->ns + (j)) |
| 50 |
< |
#define ambsam(h,i,j) (h)->sa[ambndx(h,i,j)] |
| 49 |
> |
#define AI(h,i,j) ((i)*(h)->ns + (j)) |
| 50 |
> |
#define ambsam(h,i,j) (h)->sa[AI(h,i,j)] |
| 51 |
|
|
| 52 |
|
typedef struct { |
| 53 |
|
FVECT r_i, r_i1, e_i, rcp, rI2_eJ2; |
| 54 |
|
double I1, I2; |
| 70 |
– |
int valid; |
| 55 |
|
} FFTRI; /* vectors and coefficients for Hessian calculation */ |
| 56 |
|
|
| 57 |
|
|
| 58 |
< |
/* Get index for adjacent vertex */ |
| 58 |
> |
#define XLOTSIZ 512 /* size of used car lot */ |
| 59 |
> |
#define CFIRST 0 /* first corner */ |
| 60 |
> |
#define COTHER (CFIRST+4) /* non-corner sample */ |
| 61 |
> |
#define CMAXTARGET (int)(XLOTSIZ*MINSDIST/(1-MINSDIST)) |
| 62 |
> |
|
| 63 |
|
static int |
| 64 |
< |
adjacent_verti(AMBHEMI *hp, int i, int j, int dbit) |
| 64 |
> |
psample_class(double ss[2]) /* classify patch sample */ |
| 65 |
|
{ |
| 66 |
< |
int i0 = i*hp->ns + j; |
| 67 |
< |
|
| 68 |
< |
switch (dbit) { |
| 69 |
< |
case VDB_y: return(i0 - hp->ns); |
| 70 |
< |
case VDB_x: return(i0 - 1); |
| 71 |
< |
case VDB_Xy: return(i0 - hp->ns + 1); |
| 72 |
< |
case VDB_xY: return(i0 + hp->ns - 1); |
| 73 |
< |
case VDB_X: return(i0 + 1); |
| 74 |
< |
case VDB_Y: return(i0 + hp->ns); |
| 75 |
< |
/* the following should never occur */ |
| 88 |
< |
case VDB_xy: return(i0 - hp->ns - 1); |
| 89 |
< |
case VDB_XY: return(i0 + hp->ns + 1); |
| 66 |
> |
if (ss[0] < MINSDIST) { |
| 67 |
> |
if (ss[1] < MINSDIST) |
| 68 |
> |
return(CFIRST); |
| 69 |
> |
if (ss[1] > 1.-MINSDIST) |
| 70 |
> |
return(CFIRST+2); |
| 71 |
> |
} else if (ss[0] > 1.-MINSDIST) { |
| 72 |
> |
if (ss[1] < MINSDIST) |
| 73 |
> |
return(CFIRST+1); |
| 74 |
> |
if (ss[1] > 1.-MINSDIST) |
| 75 |
> |
return(CFIRST+3); |
| 76 |
|
} |
| 77 |
< |
return(-1); |
| 77 |
> |
return(COTHER); /* not in a corner */ |
| 78 |
|
} |
| 79 |
|
|
| 80 |
< |
|
| 81 |
< |
/* Get vertex direction bit for the opposite edge to complete triangle */ |
| 96 |
< |
static int |
| 97 |
< |
vdb_edge(int db1, int db2) |
| 80 |
> |
static void |
| 81 |
> |
trade_patchsamp(double ss[2]) /* trade in problem patch position */ |
| 82 |
|
{ |
| 83 |
< |
switch (db1) { |
| 84 |
< |
case VDB_x: return(db2==VDB_y ? VDB_Xy : VDB_Y); |
| 85 |
< |
case VDB_y: return(db2==VDB_x ? VDB_xY : VDB_X); |
| 86 |
< |
case VDB_X: return(db2==VDB_Xy ? VDB_y : VDB_xY); |
| 87 |
< |
case VDB_Y: return(db2==VDB_xY ? VDB_x : VDB_Xy); |
| 88 |
< |
case VDB_xY: return(db2==VDB_x ? VDB_y : VDB_X); |
| 89 |
< |
case VDB_Xy: return(db2==VDB_y ? VDB_x : VDB_Y); |
| 83 |
> |
static float tradelot[XLOTSIZ][2]; |
| 84 |
> |
static short gterm[COTHER+1]; |
| 85 |
> |
double repl[2]; |
| 86 |
> |
int sclass, rclass; |
| 87 |
> |
int x; |
| 88 |
> |
/* initialize lot? */ |
| 89 |
> |
while (gterm[COTHER] < XLOTSIZ) { |
| 90 |
> |
tradelot[gterm[COTHER]][0] = frandom(); |
| 91 |
> |
tradelot[gterm[COTHER]][1] = frandom(); |
| 92 |
> |
++gterm[COTHER]; |
| 93 |
|
} |
| 94 |
< |
error(INTERNAL, "forbidden diagonal in vdb_edge()"); |
| 95 |
< |
return(-1); |
| 94 |
> |
/* get trade-in candidate... */ |
| 95 |
> |
sclass = psample_class(ss); /* submitted corner or not? */ |
| 96 |
> |
switch (sclass) { |
| 97 |
> |
case COTHER: /* trade mid-edge with corner/any */ |
| 98 |
> |
x = irandom( gterm[COTHER-1] > CMAXTARGET |
| 99 |
> |
? gterm[COTHER-1] : XLOTSIZ ); |
| 100 |
> |
break; |
| 101 |
> |
case CFIRST: /* kick out of first corner */ |
| 102 |
> |
x = gterm[CFIRST] + irandom(XLOTSIZ - gterm[CFIRST]); |
| 103 |
> |
break; |
| 104 |
> |
default: /* kick out of 2nd-4th corner */ |
| 105 |
> |
x = irandom(XLOTSIZ - (gterm[sclass] - gterm[sclass-1])); |
| 106 |
> |
x += (x >= gterm[sclass-1])*(gterm[sclass] - gterm[sclass-1]); |
| 107 |
> |
break; |
| 108 |
> |
} |
| 109 |
> |
repl[0] = tradelot[x][0]; /* save selected replacement (result) */ |
| 110 |
> |
repl[1] = tradelot[x][1]; |
| 111 |
> |
/* identify replacement class */ |
| 112 |
> |
for (rclass = CFIRST; rclass < COTHER; rclass++) |
| 113 |
> |
if (x < gterm[rclass]) |
| 114 |
> |
break; /* repark to keep classes grouped */ |
| 115 |
> |
while (rclass > sclass) { /* replacement group after submitted? */ |
| 116 |
> |
tradelot[x][0] = tradelot[gterm[rclass-1]][0]; |
| 117 |
> |
tradelot[x][1] = tradelot[gterm[rclass-1]][1]; |
| 118 |
> |
x = gterm[--rclass]++; |
| 119 |
> |
} |
| 120 |
> |
while (rclass < sclass) { /* replacement group before submitted? */ |
| 121 |
> |
tradelot[x][0] = tradelot[--gterm[rclass]][0]; |
| 122 |
> |
tradelot[x][1] = tradelot[gterm[rclass]][1]; |
| 123 |
> |
x = gterm[rclass++]; |
| 124 |
> |
} |
| 125 |
> |
tradelot[x][0] = ss[0]; /* complete the trade-in */ |
| 126 |
> |
tradelot[x][1] = ss[1]; |
| 127 |
> |
ss[0] = repl[0]; |
| 128 |
> |
ss[1] = repl[1]; |
| 129 |
|
} |
| 130 |
|
|
| 131 |
+ |
#undef XLOTSIZ |
| 132 |
+ |
#undef COTHER |
| 133 |
+ |
#undef CFIRST |
| 134 |
|
|
| 135 |
< |
static AMBHEMI * |
| 136 |
< |
inithemi( /* initialize sampling hemisphere */ |
| 137 |
< |
COLOR ac, |
| 138 |
< |
RAY *r, |
| 139 |
< |
double wt |
| 135 |
> |
|
| 136 |
> |
static int |
| 137 |
> |
ambcollision( /* proposed direction collides? */ |
| 138 |
> |
AMBHEMI *hp, |
| 139 |
> |
int i, |
| 140 |
> |
int j, |
| 141 |
> |
RREAL spt[2] |
| 142 |
|
) |
| 143 |
|
{ |
| 144 |
< |
AMBHEMI *hp; |
| 145 |
< |
double d; |
| 146 |
< |
int n, i; |
| 147 |
< |
/* set number of divisions */ |
| 148 |
< |
if (ambacc <= FTINY && |
| 149 |
< |
wt > (d = 0.8*intens(ac)*r->rweight/(ambdiv*minweight))) |
| 150 |
< |
wt = d; /* avoid ray termination */ |
| 151 |
< |
n = sqrt(ambdiv * wt) + 0.5; |
| 152 |
< |
i = 1 + 5*(ambacc > FTINY); /* minimum number of samples */ |
| 153 |
< |
if (n < i) |
| 154 |
< |
n = i; |
| 155 |
< |
/* allocate sampling array */ |
| 156 |
< |
hp = (AMBHEMI *)malloc(sizeof(AMBHEMI) + sizeof(AMBSAMP)*(n*n - 1)); |
| 157 |
< |
if (hp == NULL) |
| 158 |
< |
return(NULL); |
| 159 |
< |
hp->rp = r; |
| 160 |
< |
hp->ns = n; |
| 161 |
< |
/* assign coefficient */ |
| 162 |
< |
copycolor(hp->acoef, ac); |
| 163 |
< |
d = 1.0/(n*n); |
| 164 |
< |
scalecolor(hp->acoef, d); |
| 165 |
< |
/* make tangent plane axes */ |
| 166 |
< |
hp->uy[0] = 0.5 - frandom(); |
| 167 |
< |
hp->uy[1] = 0.5 - frandom(); |
| 168 |
< |
hp->uy[2] = 0.5 - frandom(); |
| 144 |
< |
for (i = 3; i--; ) |
| 145 |
< |
if ((-0.6 < r->ron[i]) & (r->ron[i] < 0.6)) |
| 146 |
< |
break; |
| 147 |
< |
if (i < 0) |
| 148 |
< |
error(CONSISTENCY, "bad ray direction in inithemi"); |
| 149 |
< |
hp->uy[i] = 1.0; |
| 150 |
< |
VCROSS(hp->ux, hp->uy, r->ron); |
| 151 |
< |
normalize(hp->ux); |
| 152 |
< |
VCROSS(hp->uy, r->ron, hp->ux); |
| 153 |
< |
/* we're ready to sample */ |
| 154 |
< |
return(hp); |
| 144 |
> |
int ii, jj; |
| 145 |
> |
/* check existing neighbors */ |
| 146 |
> |
for (ii = i-1; ii <= i+1; ii++) { |
| 147 |
> |
if (ii < 0) continue; |
| 148 |
> |
if (ii >= hp->ns) break; |
| 149 |
> |
for (jj = j-1; jj <= j+1; jj++) { |
| 150 |
> |
AMBSAMP *ap; |
| 151 |
> |
FVECT avec; |
| 152 |
> |
double dx, dy; |
| 153 |
> |
if (jj < 0) continue; |
| 154 |
> |
if (jj >= hp->ns) break; |
| 155 |
> |
if ((ii==i) & (jj==j)) continue; |
| 156 |
> |
ap = &ambsam(hp,ii,jj); |
| 157 |
> |
if (ap->d <= .5/FHUGE) |
| 158 |
> |
continue; /* no one home */ |
| 159 |
> |
VSUB(avec, ap->p, hp->rp->rop); |
| 160 |
> |
normalize(avec); /* use diskworld distance */ |
| 161 |
> |
dx = DOT(avec, hp->ux) - spt[0]; |
| 162 |
> |
dy = DOT(avec, hp->uy) - spt[1]; |
| 163 |
> |
if ((dx*dx + dy*dy)*(hp->ns*hp->ns) < |
| 164 |
> |
PI*MINSDIST*MINSDIST) |
| 165 |
> |
return(1); /* too close */ |
| 166 |
> |
} |
| 167 |
> |
} |
| 168 |
> |
return(0); /* nothing to worry about */ |
| 169 |
|
} |
| 170 |
|
|
| 171 |
|
|
| 158 |
– |
/* Sample ambient division and apply weighting coefficient */ |
| 172 |
|
static int |
| 173 |
< |
getambsamp(RAY *arp, AMBHEMI *hp, int i, int j, int n) |
| 173 |
> |
ambsample( /* initial ambient division sample */ |
| 174 |
> |
AMBHEMI *hp, |
| 175 |
> |
int i, |
| 176 |
> |
int j, |
| 177 |
> |
int n |
| 178 |
> |
) |
| 179 |
|
{ |
| 180 |
+ |
int trade_ok = (!n & (hp->ns >= 4))*21; |
| 181 |
+ |
AMBSAMP *ap = &ambsam(hp,i,j); |
| 182 |
+ |
RAY ar; |
| 183 |
|
int hlist[3], ii; |
| 184 |
< |
double spt[2], zd; |
| 184 |
> |
double ss[2]; |
| 185 |
> |
RREAL spt[2]; |
| 186 |
> |
double zd; |
| 187 |
> |
/* generate hemispherical sample */ |
| 188 |
|
/* ambient coefficient for weight */ |
| 189 |
|
if (ambacc > FTINY) |
| 190 |
< |
setcolor(arp->rcoef, AVGREFL, AVGREFL, AVGREFL); |
| 190 |
> |
setscolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL); |
| 191 |
|
else |
| 192 |
< |
copycolor(arp->rcoef, hp->acoef); |
| 193 |
< |
if (rayorigin(arp, AMBIENT, hp->rp, arp->rcoef) < 0) |
| 192 |
> |
copyscolor(ar.rcoef, hp->acoef); |
| 193 |
> |
if (rayorigin(&ar, hp->atyp, hp->rp, ar.rcoef) < 0) |
| 194 |
|
return(0); |
| 195 |
|
if (ambacc > FTINY) { |
| 196 |
< |
multcolor(arp->rcoef, hp->acoef); |
| 197 |
< |
scalecolor(arp->rcoef, 1./AVGREFL); |
| 196 |
> |
smultscolor(ar.rcoef, hp->acoef); |
| 197 |
> |
scalescolor(ar.rcoef, 1./AVGREFL); |
| 198 |
|
} |
| 199 |
|
hlist[0] = hp->rp->rno; |
| 200 |
< |
hlist[1] = j; |
| 201 |
< |
hlist[2] = i; |
| 202 |
< |
multisamp(spt, 2, urand(ilhash(hlist,3)+n)); |
| 203 |
< |
if (!n) { /* avoid border samples for n==0 */ |
| 204 |
< |
if ((spt[0] < 0.1) | (spt[0] >= 0.9)) |
| 205 |
< |
spt[0] = 0.1 + 0.8*frandom(); |
| 206 |
< |
if ((spt[1] < 0.1) | (spt[1] >= 0.9)) |
| 207 |
< |
spt[1] = 0.1 + 0.8*frandom(); |
| 200 |
> |
hlist[1] = AI(hp,i,j); |
| 201 |
> |
hlist[2] = samplendx; |
| 202 |
> |
multisamp(ss, 2, urand(ilhash(hlist,3)+n)); |
| 203 |
> |
square2disk(spt, (j+ss[1])/hp->ns, (i+ss[0])/hp->ns); |
| 204 |
> |
/* avoid coincident samples? */ |
| 205 |
> |
while (trade_ok-- && ambcollision(hp, i, j, spt)) { |
| 206 |
> |
if (trade_ok) { |
| 207 |
> |
trade_patchsamp(ss); |
| 208 |
> |
} else { /* punting... */ |
| 209 |
> |
ss[0] = MINSDIST + (1-2*MINSDIST)*frandom(); |
| 210 |
> |
ss[1] = MINSDIST + (1-2*MINSDIST)*frandom(); |
| 211 |
> |
} |
| 212 |
> |
square2disk(spt, (j+ss[1])/hp->ns, (i+ss[0])/hp->ns); |
| 213 |
|
} |
| 185 |
– |
SDsquare2disk(spt, (j+spt[1])/hp->ns, (i+spt[0])/hp->ns); |
| 214 |
|
zd = sqrt(1. - spt[0]*spt[0] - spt[1]*spt[1]); |
| 215 |
|
for (ii = 3; ii--; ) |
| 216 |
< |
arp->rdir[ii] = spt[0]*hp->ux[ii] + |
| 216 |
> |
ar.rdir[ii] = spt[0]*hp->ux[ii] + |
| 217 |
|
spt[1]*hp->uy[ii] + |
| 218 |
< |
zd*hp->rp->ron[ii]; |
| 219 |
< |
checknorm(arp->rdir); |
| 220 |
< |
dimlist[ndims++] = ambndx(hp,i,j) + 90171; |
| 221 |
< |
rayvalue(arp); /* evaluate ray */ |
| 222 |
< |
ndims--; /* apply coefficient */ |
| 223 |
< |
multcolor(arp->rcol, arp->rcoef); |
| 218 |
> |
zd*hp->onrm[ii]; |
| 219 |
> |
checknorm(ar.rdir); |
| 220 |
> |
dimlist[ndims++] = AI(hp,i,j) + 90171; |
| 221 |
> |
rayvalue(&ar); /* evaluate ray */ |
| 222 |
> |
ndims--; |
| 223 |
> |
zd = raydistance(&ar); |
| 224 |
> |
if (zd <= FTINY) |
| 225 |
> |
return(0); /* should never happen */ |
| 226 |
> |
smultscolor(ar.rcol, ar.rcoef); /* apply coefficient */ |
| 227 |
> |
if (zd*ap->d < 1.0) /* new/closer distance? */ |
| 228 |
> |
ap->d = 1.0/zd; |
| 229 |
> |
if (!n) { /* record first vertex & value */ |
| 230 |
> |
if (zd > 10.0*thescene.cusize + 1000.) |
| 231 |
> |
zd = 10.0*thescene.cusize + 1000.; |
| 232 |
> |
VSUM(ap->p, ar.rorg, ar.rdir, zd); |
| 233 |
> |
copyscolor(ap->v, ar.rcol); |
| 234 |
> |
} else { /* else update recorded value */ |
| 235 |
> |
sopscolor(hp->acol, -=, ap->v); |
| 236 |
> |
zd = 1.0/(double)(n+1); |
| 237 |
> |
scalescolor(ar.rcol, zd); |
| 238 |
> |
zd *= (double)n; |
| 239 |
> |
scalescolor(ap->v, zd); |
| 240 |
> |
saddscolor(ap->v, ar.rcol); |
| 241 |
> |
} |
| 242 |
> |
saddscolor(hp->acol, ap->v); /* add to our sum */ |
| 243 |
|
return(1); |
| 244 |
|
} |
| 245 |
|
|
| 246 |
|
|
| 247 |
< |
static AMBSAMP * |
| 201 |
< |
ambsample( /* initial ambient division sample */ |
| 202 |
< |
AMBHEMI *hp, |
| 203 |
< |
int i, |
| 204 |
< |
int j |
| 205 |
< |
) |
| 206 |
< |
{ |
| 207 |
< |
AMBSAMP *ap = &ambsam(hp,i,j); |
| 208 |
< |
RAY ar; |
| 209 |
< |
/* generate hemispherical sample */ |
| 210 |
< |
if (!getambsamp(&ar, hp, i, j, 0)) |
| 211 |
< |
goto badsample; |
| 212 |
< |
/* limit vertex distance */ |
| 213 |
< |
if (ar.rt > 10.0*thescene.cusize) |
| 214 |
< |
ar.rt = 10.0*thescene.cusize; |
| 215 |
< |
else if (ar.rt <= FTINY) /* should never happen! */ |
| 216 |
< |
goto badsample; |
| 217 |
< |
VSUM(ap->p, ar.rorg, ar.rdir, ar.rt); |
| 218 |
< |
copycolor(ap->v, ar.rcol); |
| 219 |
< |
return(ap); |
| 220 |
< |
badsample: |
| 221 |
< |
setcolor(ap->v, 0., 0., 0.); |
| 222 |
< |
VCOPY(ap->p, hp->rp->rop); |
| 223 |
< |
return(NULL); |
| 224 |
< |
} |
| 225 |
< |
|
| 226 |
< |
|
| 227 |
< |
/* Estimate errors based on ambient division differences */ |
| 247 |
> |
/* Estimate variance based on ambient division differences */ |
| 248 |
|
static float * |
| 249 |
|
getambdiffs(AMBHEMI *hp) |
| 250 |
|
{ |
| 251 |
< |
float *earr = (float *)calloc(hp->ns*hp->ns, sizeof(float)); |
| 251 |
> |
const double normf = 1./(pbright(hp->acoef) + FTINY); |
| 252 |
> |
float *earr = (float *)calloc(2*hp->ns*hp->ns, sizeof(float)); |
| 253 |
|
float *ep; |
| 254 |
|
AMBSAMP *ap; |
| 255 |
< |
double b, d2; |
| 255 |
> |
double b, b1, d2; |
| 256 |
|
int i, j; |
| 257 |
|
|
| 258 |
|
if (earr == NULL) /* out of memory? */ |
| 259 |
|
return(NULL); |
| 260 |
< |
/* compute squared neighbor diffs */ |
| 261 |
< |
for (ap = hp->sa, ep = earr, i = 0; i < hp->ns; i++) |
| 260 |
> |
/* sum squared neighbor diffs */ |
| 261 |
> |
ap = hp->sa; |
| 262 |
> |
ep = earr + hp->ns*hp->ns; /* original estimates to scratch */ |
| 263 |
> |
for (i = 0; i < hp->ns; i++) |
| 264 |
|
for (j = 0; j < hp->ns; j++, ap++, ep++) { |
| 265 |
< |
b = bright(ap[0].v); |
| 265 |
> |
b = pbright(ap[0].v); |
| 266 |
|
if (i) { /* from above */ |
| 267 |
< |
d2 = b - bright(ap[-hp->ns].v); |
| 268 |
< |
d2 *= d2; |
| 267 |
> |
b1 = pbright(ap[-hp->ns].v); |
| 268 |
> |
d2 = b - b1; |
| 269 |
> |
d2 *= d2*normf/(b + b1 + FTINY); |
| 270 |
|
ep[0] += d2; |
| 271 |
|
ep[-hp->ns] += d2; |
| 272 |
|
} |
| 273 |
< |
if (j) { /* from behind */ |
| 274 |
< |
d2 = b - bright(ap[-1].v); |
| 275 |
< |
d2 *= d2; |
| 276 |
< |
ep[0] += d2; |
| 277 |
< |
ep[-1] += d2; |
| 278 |
< |
} |
| 273 |
> |
if (!j) continue; |
| 274 |
> |
/* from behind */ |
| 275 |
> |
b1 = pbright(ap[-1].v); |
| 276 |
> |
d2 = b - b1; |
| 277 |
> |
d2 *= d2*normf/(b + b1 + FTINY); |
| 278 |
> |
ep[0] += d2; |
| 279 |
> |
ep[-1] += d2; |
| 280 |
> |
if (!i) continue; |
| 281 |
> |
/* diagonal */ |
| 282 |
> |
b1 = pbright(ap[-hp->ns-1].v); |
| 283 |
> |
d2 = b - b1; |
| 284 |
> |
d2 *= d2*normf/(b + b1 + FTINY); |
| 285 |
> |
ep[0] += d2; |
| 286 |
> |
ep[-hp->ns-1] += d2; |
| 287 |
|
} |
| 288 |
|
/* correct for number of neighbors */ |
| 289 |
< |
earr[0] *= 2.f; |
| 290 |
< |
earr[hp->ns-1] *= 2.f; |
| 291 |
< |
earr[(hp->ns-1)*hp->ns] *= 2.f; |
| 292 |
< |
earr[(hp->ns-1)*hp->ns + hp->ns-1] *= 2.f; |
| 289 |
> |
ep = earr + hp->ns*hp->ns; |
| 290 |
> |
ep[0] *= 6./3.; |
| 291 |
> |
ep[hp->ns-1] *= 6./3.; |
| 292 |
> |
ep[(hp->ns-1)*hp->ns] *= 6./3.; |
| 293 |
> |
ep[(hp->ns-1)*hp->ns + hp->ns-1] *= 6./3.; |
| 294 |
|
for (i = 1; i < hp->ns-1; i++) { |
| 295 |
< |
earr[i*hp->ns] *= 4./3.; |
| 296 |
< |
earr[i*hp->ns + hp->ns-1] *= 4./3.; |
| 295 |
> |
ep[i*hp->ns] *= 6./5.; |
| 296 |
> |
ep[i*hp->ns + hp->ns-1] *= 6./5.; |
| 297 |
|
} |
| 298 |
|
for (j = 1; j < hp->ns-1; j++) { |
| 299 |
< |
earr[j] *= 4./3.; |
| 300 |
< |
earr[(hp->ns-1)*hp->ns + j] *= 4./3.; |
| 299 |
> |
ep[j] *= 6./5.; |
| 300 |
> |
ep[(hp->ns-1)*hp->ns + j] *= 6./5.; |
| 301 |
|
} |
| 302 |
+ |
/* blur final map to reduce bias */ |
| 303 |
+ |
for (i = 0; i < hp->ns-1; i++) { |
| 304 |
+ |
float *ep2; |
| 305 |
+ |
ep = earr + i*hp->ns; |
| 306 |
+ |
ep2 = ep + hp->ns*hp->ns; |
| 307 |
+ |
for (j = 0; j < hp->ns-1; j++, ep++, ep2++) { |
| 308 |
+ |
ep[0] += .5*ep2[0] + .125*(ep2[1] + ep2[hp->ns]); |
| 309 |
+ |
ep[1] += .125*ep2[0]; |
| 310 |
+ |
ep[hp->ns] += .125*ep2[0]; |
| 311 |
+ |
} |
| 312 |
+ |
} |
| 313 |
|
return(earr); |
| 314 |
|
} |
| 315 |
|
|
| 316 |
|
|
| 317 |
|
/* Perform super-sampling on hemisphere (introduces bias) */ |
| 318 |
|
static void |
| 319 |
< |
ambsupersamp(double acol[3], AMBHEMI *hp, int cnt) |
| 319 |
> |
ambsupersamp(AMBHEMI *hp, int cnt) |
| 320 |
|
{ |
| 321 |
|
float *earr = getambdiffs(hp); |
| 322 |
< |
double e2sum = 0; |
| 279 |
< |
AMBSAMP *ap; |
| 280 |
< |
RAY ar; |
| 281 |
< |
COLOR asum; |
| 322 |
> |
double e2rem = 0; |
| 323 |
|
float *ep; |
| 324 |
< |
int i, j, n; |
| 324 |
> |
int i, j, n, nss; |
| 325 |
|
|
| 326 |
|
if (earr == NULL) /* just skip calc. if no memory */ |
| 327 |
|
return; |
| 328 |
< |
/* add up estimated variances */ |
| 329 |
< |
for (ep = earr + hp->ns*hp->ns; ep-- > earr; ) |
| 330 |
< |
e2sum += *ep; |
| 328 |
> |
/* accumulate estimated variances */ |
| 329 |
> |
for (ep = earr + hp->ns*hp->ns; ep > earr; ) |
| 330 |
> |
e2rem += *--ep; |
| 331 |
|
ep = earr; /* perform super-sampling */ |
| 332 |
< |
for (ap = hp->sa, i = 0; i < hp->ns; i++) |
| 333 |
< |
for (j = 0; j < hp->ns; j++, ap++) { |
| 334 |
< |
int nss = *ep/e2sum*cnt + frandom(); |
| 335 |
< |
setcolor(asum, 0., 0., 0.); |
| 336 |
< |
for (n = 1; n <= nss; n++) { |
| 337 |
< |
if (!getambsamp(&ar, hp, i, j, n)) { |
| 338 |
< |
nss = n-1; |
| 339 |
< |
break; |
| 299 |
< |
} |
| 300 |
< |
addcolor(asum, ar.rcol); |
| 301 |
< |
} |
| 302 |
< |
if (nss) { /* update returned ambient value */ |
| 303 |
< |
const double ssf = 1./(nss + 1); |
| 304 |
< |
for (n = 3; n--; ) |
| 305 |
< |
acol[n] += ssf*colval(asum,n) + |
| 306 |
< |
(ssf - 1.)*colval(ap->v,n); |
| 307 |
< |
} |
| 308 |
< |
e2sum -= *ep++; /* update remainders */ |
| 309 |
< |
cnt -= nss; |
| 332 |
> |
for (i = 0; i < hp->ns; i++) |
| 333 |
> |
for (j = 0; j < hp->ns; j++) { |
| 334 |
> |
if (e2rem <= FTINY) |
| 335 |
> |
goto done; /* nothing left to do */ |
| 336 |
> |
nss = *ep/e2rem*cnt + frandom(); |
| 337 |
> |
for (n = 1; n <= nss && ambsample(hp,i,j,n); n++) |
| 338 |
> |
if (!--cnt) goto done; |
| 339 |
> |
e2rem -= *ep++; /* update remainder */ |
| 340 |
|
} |
| 341 |
+ |
done: |
| 342 |
|
free(earr); |
| 343 |
|
} |
| 344 |
|
|
| 345 |
|
|
| 346 |
< |
/* Compute vertex flags, indicating farthest in each direction */ |
| 347 |
< |
static uby8 * |
| 348 |
< |
vertex_flags(AMBHEMI *hp) |
| 346 |
> |
static AMBHEMI * |
| 347 |
> |
samp_hemi( /* sample indirect hemisphere */ |
| 348 |
> |
SCOLOR rcol, |
| 349 |
> |
RAY *r, |
| 350 |
> |
double wt |
| 351 |
> |
) |
| 352 |
|
{ |
| 353 |
< |
uby8 *vflags = (uby8 *)calloc(hp->ns*hp->ns, sizeof(uby8)); |
| 354 |
< |
double *dist2a = (double *)malloc(sizeof(double)*hp->ns); |
| 355 |
< |
uby8 *vf; |
| 356 |
< |
int i, j; |
| 353 |
> |
int backside = (wt < 0); |
| 354 |
> |
AMBHEMI *hp; |
| 355 |
> |
double d; |
| 356 |
> |
int n, i, j; |
| 357 |
> |
/* insignificance check */ |
| 358 |
> |
d = sintens(rcol); |
| 359 |
> |
if (d <= FTINY) |
| 360 |
> |
return(NULL); |
| 361 |
> |
/* set number of divisions */ |
| 362 |
> |
if (backside) wt = -wt; |
| 363 |
> |
if (ambacc <= FTINY && |
| 364 |
> |
wt > (d *= 0.8*r->rweight/(ambdiv*minweight + 1e-20))) |
| 365 |
> |
wt = d; /* avoid ray termination */ |
| 366 |
> |
n = sqrt(ambdiv * wt) + 0.5; |
| 367 |
> |
i = 1 + (MINADIV-1)*(ambacc > FTINY); |
| 368 |
> |
if (n < i) /* use minimum number of samples? */ |
| 369 |
> |
n = i; |
| 370 |
> |
/* allocate sampling array */ |
| 371 |
> |
hp = (AMBHEMI *)malloc(sizeof(AMBHEMI) + sizeof(AMBSAMP)*(n*n - 1)); |
| 372 |
> |
if (hp == NULL) |
| 373 |
> |
error(SYSTEM, "out of memory in samp_hemi"); |
| 374 |
|
|
| 375 |
< |
if ((vflags == NULL) | (dist2a == NULL)) |
| 376 |
< |
error(SYSTEM, "out of memory in vertex_flags()"); |
| 377 |
< |
vf = vflags; /* compute distances along first row */ |
| 378 |
< |
for (j = 0; j < hp->ns; j++) { |
| 379 |
< |
dist2a[j] = dist2(ambsam(hp,0,j).p, hp->rp->rop); |
| 380 |
< |
++vf; |
| 381 |
< |
if (!j) continue; |
| 382 |
< |
if (dist2a[j] >= dist2a[j-1]) |
| 332 |
< |
vf[0] |= 1<<VDB_x; |
| 333 |
< |
else |
| 334 |
< |
vf[-1] |= 1<<VDB_X; |
| 375 |
> |
if (backside) { |
| 376 |
> |
hp->atyp = TAMBIENT; |
| 377 |
> |
hp->onrm[0] = -r->ron[0]; |
| 378 |
> |
hp->onrm[1] = -r->ron[1]; |
| 379 |
> |
hp->onrm[2] = -r->ron[2]; |
| 380 |
> |
} else { |
| 381 |
> |
hp->atyp = RAMBIENT; |
| 382 |
> |
VCOPY(hp->onrm, r->ron); |
| 383 |
|
} |
| 384 |
< |
/* flag subsequent rows */ |
| 385 |
< |
for (i = 1; i < hp->ns; i++) { |
| 386 |
< |
double d2n = dist2(ambsam(hp,i,0).p, hp->rp->rop); |
| 387 |
< |
for (j = 0; j < hp->ns-1; j++) { |
| 388 |
< |
double d2 = d2n; |
| 389 |
< |
if (d2 >= dist2a[j]) /* row before */ |
| 390 |
< |
vf[0] |= 1<<VDB_y; |
| 391 |
< |
else |
| 392 |
< |
vf[-hp->ns] |= 1<<VDB_Y; |
| 393 |
< |
dist2a[j] = d2n; |
| 394 |
< |
if (d2 >= dist2a[j+1]) /* diagonal we care about */ |
| 395 |
< |
vf[0] |= 1<<VDB_Xy; |
| 396 |
< |
else |
| 397 |
< |
vf[1-hp->ns] |= 1<<VDB_xY; |
| 398 |
< |
d2n = dist2(ambsam(hp,i,j+1).p, hp->rp->rop); |
| 399 |
< |
if (d2 >= d2n) /* column after */ |
| 400 |
< |
vf[0] |= 1<<VDB_X; |
| 401 |
< |
else |
| 402 |
< |
vf[1] |= 1<<VDB_x; |
| 403 |
< |
++vf; |
| 404 |
< |
} |
| 357 |
< |
if (d2n >= dist2a[j]) /* final column edge */ |
| 358 |
< |
vf[0] |= 1<<VDB_y; |
| 359 |
< |
else |
| 360 |
< |
vf[-hp->ns] |= 1<<VDB_Y; |
| 361 |
< |
dist2a[j] = d2n; |
| 362 |
< |
++vf; |
| 384 |
> |
hp->rp = r; |
| 385 |
> |
hp->ns = n; |
| 386 |
> |
scolorblack(hp->acol); |
| 387 |
> |
memset(hp->sa, 0, sizeof(AMBSAMP)*n*n); |
| 388 |
> |
hp->sampOK = 0; |
| 389 |
> |
/* assign coefficient */ |
| 390 |
> |
copyscolor(hp->acoef, rcol); |
| 391 |
> |
d = 1.0/(n*n); |
| 392 |
> |
scalescolor(hp->acoef, d); |
| 393 |
> |
/* make tangent plane axes */ |
| 394 |
> |
if (!getperpendicular(hp->ux, hp->onrm, 1)) |
| 395 |
> |
error(CONSISTENCY, "bad ray direction in samp_hemi"); |
| 396 |
> |
VCROSS(hp->uy, hp->onrm, hp->ux); |
| 397 |
> |
/* sample divisions */ |
| 398 |
> |
for (i = hp->ns; i--; ) |
| 399 |
> |
for (j = hp->ns; j--; ) |
| 400 |
> |
hp->sampOK += ambsample(hp, i, j, 0); |
| 401 |
> |
copyscolor(rcol, hp->acol); |
| 402 |
> |
if (!hp->sampOK) { /* utter failure? */ |
| 403 |
> |
free(hp); |
| 404 |
> |
return(NULL); |
| 405 |
|
} |
| 406 |
< |
free(dist2a); |
| 407 |
< |
return(vflags); |
| 406 |
> |
if (hp->sampOK < hp->ns*hp->ns) { |
| 407 |
> |
hp->sampOK *= -1; /* soft failure */ |
| 408 |
> |
return(hp); |
| 409 |
> |
} |
| 410 |
> |
if (hp->sampOK <= MINADIV*MINADIV) |
| 411 |
> |
return(hp); /* don't bother super-sampling */ |
| 412 |
> |
n = ambssamp*wt + 0.5; |
| 413 |
> |
if (n >= 4*hp->ns) { /* perform super-sampling? */ |
| 414 |
> |
ambsupersamp(hp, n); |
| 415 |
> |
copyscolor(rcol, hp->acol); |
| 416 |
> |
} |
| 417 |
> |
return(hp); /* all is well */ |
| 418 |
|
} |
| 419 |
|
|
| 420 |
|
|
| 421 |
|
/* Return brightness of farthest ambient sample */ |
| 422 |
|
static double |
| 423 |
< |
back_ambval(AMBHEMI *hp, int i, int j, int dbit1, int dbit2, const uby8 *vflags) |
| 423 |
> |
back_ambval(AMBHEMI *hp, const int n1, const int n2, const int n3) |
| 424 |
|
{ |
| 425 |
< |
const int v0 = ambndx(hp,i,j); |
| 426 |
< |
const int tflags = (1<<dbit1 | 1<<dbit2); |
| 427 |
< |
int v1, v2; |
| 428 |
< |
|
| 429 |
< |
if ((vflags[v0] & tflags) == tflags) /* is v0 the farthest? */ |
| 430 |
< |
return(colval(hp->sa[v0].v,CIEY)); |
| 431 |
< |
v1 = adjacent_verti(hp, i, j, dbit1); |
| 432 |
< |
if (vflags[v0] & 1<<dbit2) /* v1 farthest if v0>v2 */ |
| 381 |
< |
return(colval(hp->sa[v1].v,CIEY)); |
| 382 |
< |
v2 = adjacent_verti(hp, i, j, dbit2); |
| 383 |
< |
if (vflags[v0] & 1<<dbit1) /* v2 farthest if v0>v1 */ |
| 384 |
< |
return(colval(hp->sa[v2].v,CIEY)); |
| 385 |
< |
/* else check if v1>v2 */ |
| 386 |
< |
if (vflags[v1] & 1<<vdb_edge(dbit1,dbit2)) |
| 387 |
< |
return(colval(hp->sa[v1].v,CIEY)); |
| 388 |
< |
return(colval(hp->sa[v2].v,CIEY)); |
| 425 |
> |
if (hp->sa[n1].d <= hp->sa[n2].d) { |
| 426 |
> |
if (hp->sa[n1].d <= hp->sa[n3].d) |
| 427 |
> |
return(hp->sa[n1].v[0]); |
| 428 |
> |
return(hp->sa[n3].v[0]); |
| 429 |
> |
} |
| 430 |
> |
if (hp->sa[n2].d <= hp->sa[n3].d) |
| 431 |
> |
return(hp->sa[n2].v[0]); |
| 432 |
> |
return(hp->sa[n3].v[0]); |
| 433 |
|
} |
| 434 |
|
|
| 435 |
|
|
| 436 |
|
/* Compute vectors and coefficients for Hessian/gradient calcs */ |
| 437 |
|
static void |
| 438 |
< |
comp_fftri(FFTRI *ftp, AMBHEMI *hp, int i, int j, int dbit, const uby8 *vflags) |
| 438 |
> |
comp_fftri(FFTRI *ftp, AMBHEMI *hp, const int n0, const int n1) |
| 439 |
|
{ |
| 440 |
< |
const int i0 = ambndx(hp,i,j); |
| 441 |
< |
double rdot_cp, dot_e, dot_er, rdot_r, rdot_r1, J2; |
| 398 |
< |
int i1, ii; |
| 440 |
> |
double rdot_cp, dot_e, dot_er, rdot_r, rdot_r1, J2; |
| 441 |
> |
int ii; |
| 442 |
|
|
| 443 |
< |
ftp->valid = 0; /* check if we can skip this edge */ |
| 444 |
< |
ii = adjacent_trifl[dbit]; |
| 445 |
< |
if ((vflags[i0] & ii) == ii) /* cancels if vertex used as value */ |
| 403 |
< |
return; |
| 404 |
< |
i1 = adjacent_verti(hp, i, j, dbit); |
| 405 |
< |
ii = adjacent_trifl[VDB_OPP(dbit)]; |
| 406 |
< |
if ((vflags[i1] & ii) == ii) /* on either end (for both triangles) */ |
| 407 |
< |
return; |
| 408 |
< |
/* else go ahead with calculation */ |
| 409 |
< |
VSUB(ftp->r_i, hp->sa[i0].p, hp->rp->rop); |
| 410 |
< |
VSUB(ftp->r_i1, hp->sa[i1].p, hp->rp->rop); |
| 411 |
< |
VSUB(ftp->e_i, hp->sa[i1].p, hp->sa[i0].p); |
| 443 |
> |
VSUB(ftp->r_i, hp->sa[n0].p, hp->rp->rop); |
| 444 |
> |
VSUB(ftp->r_i1, hp->sa[n1].p, hp->rp->rop); |
| 445 |
> |
VSUB(ftp->e_i, hp->sa[n1].p, hp->sa[n0].p); |
| 446 |
|
VCROSS(ftp->rcp, ftp->r_i, ftp->r_i1); |
| 447 |
|
rdot_cp = 1.0/DOT(ftp->rcp,ftp->rcp); |
| 448 |
|
dot_e = DOT(ftp->e_i,ftp->e_i); |
| 456 |
|
J2 = ( 0.5*(rdot_r - rdot_r1) - dot_er*ftp->I2 ) / dot_e; |
| 457 |
|
for (ii = 3; ii--; ) |
| 458 |
|
ftp->rI2_eJ2[ii] = ftp->I2*ftp->r_i[ii] + J2*ftp->e_i[ii]; |
| 425 |
– |
ftp->valid++; |
| 459 |
|
} |
| 460 |
|
|
| 461 |
|
|
| 481 |
|
double d1, d2, d3, d4; |
| 482 |
|
double I3, J3, K3; |
| 483 |
|
int i, j; |
| 451 |
– |
|
| 452 |
– |
if (!ftp->valid) { /* preemptive test */ |
| 453 |
– |
memset(hess, 0, sizeof(FVECT)*3); |
| 454 |
– |
return; |
| 455 |
– |
} |
| 484 |
|
/* compute intermediate coefficients */ |
| 485 |
|
d1 = 1.0/DOT(ftp->r_i,ftp->r_i); |
| 486 |
|
d2 = 1.0/DOT(ftp->r_i1,ftp->r_i1); |
| 544 |
|
double f1; |
| 545 |
|
int i; |
| 546 |
|
|
| 519 |
– |
if (!ftp->valid) { /* preemptive test */ |
| 520 |
– |
memset(grad, 0, sizeof(FVECT)); |
| 521 |
– |
return; |
| 522 |
– |
} |
| 547 |
|
f1 = 2.0*DOT(nrm, ftp->rcp); |
| 548 |
|
VCROSS(ncp, nrm, ftp->e_i); |
| 549 |
|
for (i = 3; i--; ) |
| 573 |
|
|
| 574 |
|
|
| 575 |
|
/* Compute anisotropic radii and eigenvector directions */ |
| 576 |
< |
static int |
| 576 |
> |
static void |
| 577 |
|
eigenvectors(FVECT uv[2], float ra[2], FVECT hessian[3]) |
| 578 |
|
{ |
| 579 |
|
double hess2[2][2]; |
| 595 |
|
if (i == 1) /* double-root (circle) */ |
| 596 |
|
evalue[1] = evalue[0]; |
| 597 |
|
if (!i || ((evalue[0] = fabs(evalue[0])) <= FTINY*FTINY) | |
| 598 |
< |
((evalue[1] = fabs(evalue[1])) <= FTINY*FTINY) ) |
| 599 |
< |
error(INTERNAL, "bad eigenvalue calculation"); |
| 600 |
< |
|
| 598 |
> |
((evalue[1] = fabs(evalue[1])) <= FTINY*FTINY) ) { |
| 599 |
> |
ra[0] = ra[1] = maxarad; |
| 600 |
> |
return; |
| 601 |
> |
} |
| 602 |
|
if (evalue[0] > evalue[1]) { |
| 603 |
|
ra[0] = sqrt(sqrt(4.0/evalue[0])); |
| 604 |
|
ra[1] = sqrt(sqrt(4.0/evalue[1])); |
| 633 |
|
static char memerrmsg[] = "out of memory in ambHessian()"; |
| 634 |
|
FVECT (*hessrow)[3] = NULL; |
| 635 |
|
FVECT *gradrow = NULL; |
| 611 |
– |
uby8 *vflags; |
| 636 |
|
FVECT hessian[3]; |
| 637 |
|
FVECT gradient; |
| 638 |
|
FFTRI fftr; |
| 654 |
|
error(SYSTEM, memerrmsg); |
| 655 |
|
memset(gradient, 0, sizeof(gradient)); |
| 656 |
|
} |
| 633 |
– |
/* get vertex position flags */ |
| 634 |
– |
vflags = vertex_flags(hp); |
| 657 |
|
/* compute first row of edges */ |
| 658 |
|
for (j = 0; j < hp->ns-1; j++) { |
| 659 |
< |
comp_fftri(&fftr, hp, 0, j, VDB_X, vflags); |
| 659 |
> |
comp_fftri(&fftr, hp, AI(hp,0,j), AI(hp,0,j+1)); |
| 660 |
|
if (hessrow != NULL) |
| 661 |
< |
comp_hessian(hessrow[j], &fftr, hp->rp->ron); |
| 661 |
> |
comp_hessian(hessrow[j], &fftr, hp->onrm); |
| 662 |
|
if (gradrow != NULL) |
| 663 |
< |
comp_gradient(gradrow[j], &fftr, hp->rp->ron); |
| 663 |
> |
comp_gradient(gradrow[j], &fftr, hp->onrm); |
| 664 |
|
} |
| 665 |
|
/* sum each row of triangles */ |
| 666 |
|
for (i = 0; i < hp->ns-1; i++) { |
| 667 |
|
FVECT hesscol[3]; /* compute first vertical edge */ |
| 668 |
|
FVECT gradcol; |
| 669 |
< |
comp_fftri(&fftr, hp, i, 0, VDB_Y, vflags); |
| 669 |
> |
comp_fftri(&fftr, hp, AI(hp,i,0), AI(hp,i+1,0)); |
| 670 |
|
if (hessrow != NULL) |
| 671 |
< |
comp_hessian(hesscol, &fftr, hp->rp->ron); |
| 671 |
> |
comp_hessian(hesscol, &fftr, hp->onrm); |
| 672 |
|
if (gradrow != NULL) |
| 673 |
< |
comp_gradient(gradcol, &fftr, hp->rp->ron); |
| 673 |
> |
comp_gradient(gradcol, &fftr, hp->onrm); |
| 674 |
|
for (j = 0; j < hp->ns-1; j++) { |
| 675 |
|
FVECT hessdia[3]; /* compute triangle contributions */ |
| 676 |
|
FVECT graddia; |
| 677 |
|
double backg; |
| 678 |
< |
backg = back_ambval(hp, i, j, VDB_X, VDB_Y, vflags); |
| 678 |
> |
backg = back_ambval(hp, AI(hp,i,j), |
| 679 |
> |
AI(hp,i,j+1), AI(hp,i+1,j)); |
| 680 |
|
/* diagonal (inner) edge */ |
| 681 |
< |
comp_fftri(&fftr, hp, i, j+1, VDB_xY, vflags); |
| 681 |
> |
comp_fftri(&fftr, hp, AI(hp,i,j+1), AI(hp,i+1,j)); |
| 682 |
|
if (hessrow != NULL) { |
| 683 |
< |
comp_hessian(hessdia, &fftr, hp->rp->ron); |
| 683 |
> |
comp_hessian(hessdia, &fftr, hp->onrm); |
| 684 |
|
rev_hessian(hesscol); |
| 685 |
|
add2hessian(hessian, hessrow[j], hessdia, hesscol, backg); |
| 686 |
|
} |
| 687 |
|
if (gradrow != NULL) { |
| 688 |
< |
comp_gradient(graddia, &fftr, hp->rp->ron); |
| 688 |
> |
comp_gradient(graddia, &fftr, hp->onrm); |
| 689 |
|
rev_gradient(gradcol); |
| 690 |
|
add2gradient(gradient, gradrow[j], graddia, gradcol, backg); |
| 691 |
|
} |
| 692 |
|
/* initialize edge in next row */ |
| 693 |
< |
comp_fftri(&fftr, hp, i+1, j+1, VDB_x, vflags); |
| 693 |
> |
comp_fftri(&fftr, hp, AI(hp,i+1,j+1), AI(hp,i+1,j)); |
| 694 |
|
if (hessrow != NULL) |
| 695 |
< |
comp_hessian(hessrow[j], &fftr, hp->rp->ron); |
| 695 |
> |
comp_hessian(hessrow[j], &fftr, hp->onrm); |
| 696 |
|
if (gradrow != NULL) |
| 697 |
< |
comp_gradient(gradrow[j], &fftr, hp->rp->ron); |
| 697 |
> |
comp_gradient(gradrow[j], &fftr, hp->onrm); |
| 698 |
|
/* new column edge & paired triangle */ |
| 699 |
< |
backg = back_ambval(hp, i+1, j+1, VDB_x, VDB_y, vflags); |
| 700 |
< |
comp_fftri(&fftr, hp, i, j+1, VDB_Y, vflags); |
| 699 |
> |
backg = back_ambval(hp, AI(hp,i+1,j+1), |
| 700 |
> |
AI(hp,i+1,j), AI(hp,i,j+1)); |
| 701 |
> |
comp_fftri(&fftr, hp, AI(hp,i,j+1), AI(hp,i+1,j+1)); |
| 702 |
|
if (hessrow != NULL) { |
| 703 |
< |
comp_hessian(hesscol, &fftr, hp->rp->ron); |
| 703 |
> |
comp_hessian(hesscol, &fftr, hp->onrm); |
| 704 |
|
rev_hessian(hessdia); |
| 705 |
|
add2hessian(hessian, hessrow[j], hessdia, hesscol, backg); |
| 706 |
|
if (i < hp->ns-2) |
| 707 |
|
rev_hessian(hessrow[j]); |
| 708 |
|
} |
| 709 |
|
if (gradrow != NULL) { |
| 710 |
< |
comp_gradient(gradcol, &fftr, hp->rp->ron); |
| 710 |
> |
comp_gradient(gradcol, &fftr, hp->onrm); |
| 711 |
|
rev_gradient(graddia); |
| 712 |
|
add2gradient(gradient, gradrow[j], graddia, gradcol, backg); |
| 713 |
|
if (i < hp->ns-2) |
| 718 |
|
/* release row buffers */ |
| 719 |
|
if (hessrow != NULL) free(hessrow); |
| 720 |
|
if (gradrow != NULL) free(gradrow); |
| 697 |
– |
free(vflags); |
| 721 |
|
|
| 722 |
|
if (ra != NULL) /* extract eigenvectors & radii */ |
| 723 |
|
eigenvectors(uv, ra, hessian); |
| 743 |
|
/* use vector for azimuth + 90deg */ |
| 744 |
|
VSUB(vd, ap->p, hp->rp->rop); |
| 745 |
|
/* brightness over cosine factor */ |
| 746 |
< |
gfact = colval(ap->v,CIEY) / DOT(hp->rp->ron, vd); |
| 746 |
> |
gfact = ap->v[0] / DOT(hp->onrm, vd); |
| 747 |
|
/* sine = proj_radius/vd_length */ |
| 748 |
|
dgsum[0] -= DOT(uv[1], vd) * gfact; |
| 749 |
|
dgsum[1] += DOT(uv[0], vd) * gfact; |
| 753 |
|
} |
| 754 |
|
|
| 755 |
|
|
| 756 |
+ |
/* Compute potential light leak direction flags for cache value */ |
| 757 |
+ |
static uint32 |
| 758 |
+ |
ambcorral(AMBHEMI *hp, FVECT uv[2], const double r0, const double r1) |
| 759 |
+ |
{ |
| 760 |
+ |
const double max_d = 1.0/(minarad*ambacc + 0.001); |
| 761 |
+ |
const double ang_res = 0.5*PI/hp->ns; |
| 762 |
+ |
const double ang_step = ang_res/((int)(16/PI*ang_res) + 1.01); |
| 763 |
+ |
double avg_d = 0; |
| 764 |
+ |
uint32 flgs = 0; |
| 765 |
+ |
FVECT vec; |
| 766 |
+ |
double u, v; |
| 767 |
+ |
double ang, a1; |
| 768 |
+ |
int i, j; |
| 769 |
+ |
/* don't bother for a few samples */ |
| 770 |
+ |
if (hp->ns < 8) |
| 771 |
+ |
return(0); |
| 772 |
+ |
/* check distances overhead */ |
| 773 |
+ |
for (i = hp->ns*3/4; i-- > hp->ns>>2; ) |
| 774 |
+ |
for (j = hp->ns*3/4; j-- > hp->ns>>2; ) |
| 775 |
+ |
avg_d += ambsam(hp,i,j).d; |
| 776 |
+ |
avg_d *= 4.0/(hp->ns*hp->ns); |
| 777 |
+ |
if (avg_d*r0 >= 1.0) /* ceiling too low for corral? */ |
| 778 |
+ |
return(0); |
| 779 |
+ |
if (avg_d >= max_d) /* insurance */ |
| 780 |
+ |
return(0); |
| 781 |
+ |
/* else circle around perimeter */ |
| 782 |
+ |
for (i = 0; i < hp->ns; i++) |
| 783 |
+ |
for (j = 0; j < hp->ns; j += !i|(i==hp->ns-1) ? 1 : hp->ns-1) { |
| 784 |
+ |
AMBSAMP *ap = &ambsam(hp,i,j); |
| 785 |
+ |
if ((ap->d <= FTINY) | (ap->d >= max_d)) |
| 786 |
+ |
continue; /* too far or too near */ |
| 787 |
+ |
VSUB(vec, ap->p, hp->rp->rop); |
| 788 |
+ |
u = DOT(vec, uv[0]); |
| 789 |
+ |
v = DOT(vec, uv[1]); |
| 790 |
+ |
if ((r0*r0*u*u + r1*r1*v*v) * ap->d*ap->d <= u*u + v*v) |
| 791 |
+ |
continue; /* occluder outside ellipse */ |
| 792 |
+ |
ang = atan2a(v, u); /* else set direction flags */ |
| 793 |
+ |
for (a1 = ang-ang_res; a1 <= ang+ang_res; a1 += ang_step) |
| 794 |
+ |
flgs |= 1L<<(int)(16/PI*(a1 + 2.*PI*(a1 < 0))); |
| 795 |
+ |
} |
| 796 |
+ |
return(flgs); |
| 797 |
+ |
} |
| 798 |
+ |
|
| 799 |
+ |
|
| 800 |
|
int |
| 801 |
|
doambient( /* compute ambient component */ |
| 802 |
< |
COLOR rcol, /* input/output color */ |
| 802 |
> |
SCOLOR rcol, /* input/output color */ |
| 803 |
|
RAY *r, |
| 804 |
< |
double wt, |
| 804 |
> |
double wt, /* negative for back side */ |
| 805 |
|
FVECT uv[2], /* returned (optional) */ |
| 806 |
|
float ra[2], /* returned (optional) */ |
| 807 |
|
float pg[2], /* returned (optional) */ |
| 808 |
< |
float dg[2] /* returned (optional) */ |
| 808 |
> |
float dg[2], /* returned (optional) */ |
| 809 |
> |
uint32 *crlp /* returned (optional) */ |
| 810 |
|
) |
| 811 |
|
{ |
| 812 |
< |
AMBHEMI *hp = inithemi(rcol, r, wt); |
| 745 |
< |
int cnt; |
| 812 |
> |
AMBHEMI *hp = samp_hemi(rcol, r, wt); |
| 813 |
|
FVECT my_uv[2]; |
| 814 |
< |
double d, K, acol[3]; |
| 814 |
> |
double d, K; |
| 815 |
|
AMBSAMP *ap; |
| 816 |
< |
int i, j; |
| 817 |
< |
/* check/initialize */ |
| 751 |
< |
if (hp == NULL) |
| 752 |
< |
return(0); |
| 816 |
> |
int i; |
| 817 |
> |
/* clear return values */ |
| 818 |
|
if (uv != NULL) |
| 819 |
|
memset(uv, 0, sizeof(FVECT)*2); |
| 820 |
|
if (ra != NULL) |
| 823 |
|
pg[0] = pg[1] = 0.0; |
| 824 |
|
if (dg != NULL) |
| 825 |
|
dg[0] = dg[1] = 0.0; |
| 826 |
< |
/* sample the hemisphere */ |
| 827 |
< |
acol[0] = acol[1] = acol[2] = 0.0; |
| 828 |
< |
cnt = 0; |
| 829 |
< |
for (i = hp->ns; i--; ) |
| 830 |
< |
for (j = hp->ns; j--; ) |
| 831 |
< |
if ((ap = ambsample(hp, i, j)) != NULL) { |
| 832 |
< |
addcolor(acol, ap->v); |
| 833 |
< |
++cnt; |
| 834 |
< |
} |
| 770 |
< |
if (!cnt) { |
| 771 |
< |
setcolor(rcol, 0.0, 0.0, 0.0); |
| 772 |
< |
free(hp); |
| 773 |
< |
return(0); /* no valid samples */ |
| 826 |
> |
if (crlp != NULL) |
| 827 |
> |
*crlp = 0; |
| 828 |
> |
if (hp == NULL) /* sampling falure? */ |
| 829 |
> |
return(0); |
| 830 |
> |
|
| 831 |
> |
if ((ra == NULL) & (pg == NULL) & (dg == NULL) || |
| 832 |
> |
(hp->sampOK < 0) | (hp->ns < MINADIV)) { |
| 833 |
> |
free(hp); /* Hessian not requested/possible */ |
| 834 |
> |
return(-1); /* value-only return value */ |
| 835 |
|
} |
| 836 |
< |
if (cnt < hp->ns*hp->ns) { /* incomplete sampling? */ |
| 837 |
< |
copycolor(rcol, acol); |
| 777 |
< |
free(hp); |
| 778 |
< |
return(-1); /* return value w/o Hessian */ |
| 779 |
< |
} |
| 780 |
< |
cnt = ambssamp*wt + 0.5; /* perform super-sampling? */ |
| 781 |
< |
if (cnt > 0) |
| 782 |
< |
ambsupersamp(acol, hp, cnt); |
| 783 |
< |
copycolor(rcol, acol); /* final indirect irradiance/PI */ |
| 784 |
< |
if ((ra == NULL) & (pg == NULL) & (dg == NULL)) { |
| 785 |
< |
free(hp); |
| 786 |
< |
return(-1); /* no radius or gradient calc. */ |
| 787 |
< |
} |
| 788 |
< |
if ((d = bright(acol)) > FTINY) { /* normalize Y values */ |
| 789 |
< |
d = 0.99*(hp->ns*hp->ns)/d; |
| 836 |
> |
if ((d = scolor_mean(rcol)) > FTINY) { |
| 837 |
> |
d = 0.99*(hp->ns*hp->ns)/d; /* normalize avg. values */ |
| 838 |
|
K = 0.01; |
| 839 |
|
} else { /* or fall back on geometric Hessian */ |
| 840 |
|
K = 1.0; |
| 841 |
|
pg = NULL; |
| 842 |
|
dg = NULL; |
| 843 |
+ |
crlp = NULL; |
| 844 |
|
} |
| 845 |
< |
ap = hp->sa; /* relative Y channel from here on... */ |
| 845 |
> |
ap = hp->sa; /* single channel from here on... */ |
| 846 |
|
for (i = hp->ns*hp->ns; i--; ap++) |
| 847 |
< |
colval(ap->v,CIEY) = bright(ap->v)*d + K; |
| 847 |
> |
ap->v[0] = scolor_mean(ap->v)*d + K; |
| 848 |
|
|
| 849 |
|
if (uv == NULL) /* make sure we have axis pointers */ |
| 850 |
|
uv = my_uv; |
| 868 |
|
if (ra[1] < minarad) |
| 869 |
|
ra[1] = minarad; |
| 870 |
|
} |
| 871 |
< |
ra[0] *= d = 1.0/sqrt(sqrt(wt)); |
| 871 |
> |
ra[0] *= d = 1.0/sqrt(fabs(wt)); |
| 872 |
|
if ((ra[1] *= d) > 2.0*ra[0]) |
| 873 |
|
ra[1] = 2.0*ra[0]; |
| 874 |
|
if (ra[1] > maxarad) { |
| 876 |
|
if (ra[0] > maxarad) |
| 877 |
|
ra[0] = maxarad; |
| 878 |
|
} |
| 879 |
+ |
/* flag encroached directions */ |
| 880 |
+ |
if (crlp != NULL) /* XXX doesn't update with changes to ambacc */ |
| 881 |
+ |
*crlp = ambcorral(hp, uv, ra[0]*ambacc, ra[1]*ambacc); |
| 882 |
|
if (pg != NULL) { /* cap gradient if necessary */ |
| 883 |
|
d = pg[0]*pg[0]*ra[0]*ra[0] + pg[1]*pg[1]*ra[1]*ra[1]; |
| 884 |
|
if (d > 1.0) { |
| 891 |
|
free(hp); /* clean up and return */ |
| 892 |
|
return(1); |
| 893 |
|
} |
| 842 |
– |
|
| 843 |
– |
|
| 844 |
– |
#else /* ! NEWAMB */ |
| 845 |
– |
|
| 846 |
– |
|
| 847 |
– |
void |
| 848 |
– |
inithemi( /* initialize sampling hemisphere */ |
| 849 |
– |
AMBHEMI *hp, |
| 850 |
– |
COLOR ac, |
| 851 |
– |
RAY *r, |
| 852 |
– |
double wt |
| 853 |
– |
) |
| 854 |
– |
{ |
| 855 |
– |
double d; |
| 856 |
– |
int i; |
| 857 |
– |
/* set number of divisions */ |
| 858 |
– |
if (ambacc <= FTINY && |
| 859 |
– |
wt > (d = 0.8*intens(ac)*r->rweight/(ambdiv*minweight))) |
| 860 |
– |
wt = d; /* avoid ray termination */ |
| 861 |
– |
hp->nt = sqrt(ambdiv * wt / PI) + 0.5; |
| 862 |
– |
i = ambacc > FTINY ? 3 : 1; /* minimum number of samples */ |
| 863 |
– |
if (hp->nt < i) |
| 864 |
– |
hp->nt = i; |
| 865 |
– |
hp->np = PI * hp->nt + 0.5; |
| 866 |
– |
/* set number of super-samples */ |
| 867 |
– |
hp->ns = ambssamp * wt + 0.5; |
| 868 |
– |
/* assign coefficient */ |
| 869 |
– |
copycolor(hp->acoef, ac); |
| 870 |
– |
d = 1.0/(hp->nt*hp->np); |
| 871 |
– |
scalecolor(hp->acoef, d); |
| 872 |
– |
/* make axes */ |
| 873 |
– |
VCOPY(hp->uz, r->ron); |
| 874 |
– |
hp->uy[0] = hp->uy[1] = hp->uy[2] = 0.0; |
| 875 |
– |
for (i = 0; i < 3; i++) |
| 876 |
– |
if (hp->uz[i] < 0.6 && hp->uz[i] > -0.6) |
| 877 |
– |
break; |
| 878 |
– |
if (i >= 3) |
| 879 |
– |
error(CONSISTENCY, "bad ray direction in inithemi"); |
| 880 |
– |
hp->uy[i] = 1.0; |
| 881 |
– |
fcross(hp->ux, hp->uy, hp->uz); |
| 882 |
– |
normalize(hp->ux); |
| 883 |
– |
fcross(hp->uy, hp->uz, hp->ux); |
| 884 |
– |
} |
| 885 |
– |
|
| 886 |
– |
|
| 887 |
– |
int |
| 888 |
– |
divsample( /* sample a division */ |
| 889 |
– |
AMBSAMP *dp, |
| 890 |
– |
AMBHEMI *h, |
| 891 |
– |
RAY *r |
| 892 |
– |
) |
| 893 |
– |
{ |
| 894 |
– |
RAY ar; |
| 895 |
– |
int hlist[3]; |
| 896 |
– |
double spt[2]; |
| 897 |
– |
double xd, yd, zd; |
| 898 |
– |
double b2; |
| 899 |
– |
double phi; |
| 900 |
– |
int i; |
| 901 |
– |
/* ambient coefficient for weight */ |
| 902 |
– |
if (ambacc > FTINY) |
| 903 |
– |
setcolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL); |
| 904 |
– |
else |
| 905 |
– |
copycolor(ar.rcoef, h->acoef); |
| 906 |
– |
if (rayorigin(&ar, AMBIENT, r, ar.rcoef) < 0) |
| 907 |
– |
return(-1); |
| 908 |
– |
if (ambacc > FTINY) { |
| 909 |
– |
multcolor(ar.rcoef, h->acoef); |
| 910 |
– |
scalecolor(ar.rcoef, 1./AVGREFL); |
| 911 |
– |
} |
| 912 |
– |
hlist[0] = r->rno; |
| 913 |
– |
hlist[1] = dp->t; |
| 914 |
– |
hlist[2] = dp->p; |
| 915 |
– |
multisamp(spt, 2, urand(ilhash(hlist,3)+dp->n)); |
| 916 |
– |
zd = sqrt((dp->t + spt[0])/h->nt); |
| 917 |
– |
phi = 2.0*PI * (dp->p + spt[1])/h->np; |
| 918 |
– |
xd = tcos(phi) * zd; |
| 919 |
– |
yd = tsin(phi) * zd; |
| 920 |
– |
zd = sqrt(1.0 - zd*zd); |
| 921 |
– |
for (i = 0; i < 3; i++) |
| 922 |
– |
ar.rdir[i] = xd*h->ux[i] + |
| 923 |
– |
yd*h->uy[i] + |
| 924 |
– |
zd*h->uz[i]; |
| 925 |
– |
checknorm(ar.rdir); |
| 926 |
– |
dimlist[ndims++] = dp->t*h->np + dp->p + 90171; |
| 927 |
– |
rayvalue(&ar); |
| 928 |
– |
ndims--; |
| 929 |
– |
multcolor(ar.rcol, ar.rcoef); /* apply coefficient */ |
| 930 |
– |
addcolor(dp->v, ar.rcol); |
| 931 |
– |
/* use rt to improve gradient calc */ |
| 932 |
– |
if (ar.rt > FTINY && ar.rt < FHUGE) |
| 933 |
– |
dp->r += 1.0/ar.rt; |
| 934 |
– |
/* (re)initialize error */ |
| 935 |
– |
if (dp->n++) { |
| 936 |
– |
b2 = bright(dp->v)/dp->n - bright(ar.rcol); |
| 937 |
– |
b2 = b2*b2 + dp->k*((dp->n-1)*(dp->n-1)); |
| 938 |
– |
dp->k = b2/(dp->n*dp->n); |
| 939 |
– |
} else |
| 940 |
– |
dp->k = 0.0; |
| 941 |
– |
return(0); |
| 942 |
– |
} |
| 943 |
– |
|
| 944 |
– |
|
| 945 |
– |
static int |
| 946 |
– |
ambcmp( /* decreasing order */ |
| 947 |
– |
const void *p1, |
| 948 |
– |
const void *p2 |
| 949 |
– |
) |
| 950 |
– |
{ |
| 951 |
– |
const AMBSAMP *d1 = (const AMBSAMP *)p1; |
| 952 |
– |
const AMBSAMP *d2 = (const AMBSAMP *)p2; |
| 953 |
– |
|
| 954 |
– |
if (d1->k < d2->k) |
| 955 |
– |
return(1); |
| 956 |
– |
if (d1->k > d2->k) |
| 957 |
– |
return(-1); |
| 958 |
– |
return(0); |
| 959 |
– |
} |
| 960 |
– |
|
| 961 |
– |
|
| 962 |
– |
static int |
| 963 |
– |
ambnorm( /* standard order */ |
| 964 |
– |
const void *p1, |
| 965 |
– |
const void *p2 |
| 966 |
– |
) |
| 967 |
– |
{ |
| 968 |
– |
const AMBSAMP *d1 = (const AMBSAMP *)p1; |
| 969 |
– |
const AMBSAMP *d2 = (const AMBSAMP *)p2; |
| 970 |
– |
int c; |
| 971 |
– |
|
| 972 |
– |
if ( (c = d1->t - d2->t) ) |
| 973 |
– |
return(c); |
| 974 |
– |
return(d1->p - d2->p); |
| 975 |
– |
} |
| 976 |
– |
|
| 977 |
– |
|
| 978 |
– |
double |
| 979 |
– |
doambient( /* compute ambient component */ |
| 980 |
– |
COLOR rcol, |
| 981 |
– |
RAY *r, |
| 982 |
– |
double wt, |
| 983 |
– |
FVECT pg, |
| 984 |
– |
FVECT dg |
| 985 |
– |
) |
| 986 |
– |
{ |
| 987 |
– |
double b, d=0; |
| 988 |
– |
AMBHEMI hemi; |
| 989 |
– |
AMBSAMP *div; |
| 990 |
– |
AMBSAMP dnew; |
| 991 |
– |
double acol[3]; |
| 992 |
– |
AMBSAMP *dp; |
| 993 |
– |
double arad; |
| 994 |
– |
int divcnt; |
| 995 |
– |
int i, j; |
| 996 |
– |
/* initialize hemisphere */ |
| 997 |
– |
inithemi(&hemi, rcol, r, wt); |
| 998 |
– |
divcnt = hemi.nt * hemi.np; |
| 999 |
– |
/* initialize */ |
| 1000 |
– |
if (pg != NULL) |
| 1001 |
– |
pg[0] = pg[1] = pg[2] = 0.0; |
| 1002 |
– |
if (dg != NULL) |
| 1003 |
– |
dg[0] = dg[1] = dg[2] = 0.0; |
| 1004 |
– |
setcolor(rcol, 0.0, 0.0, 0.0); |
| 1005 |
– |
if (divcnt == 0) |
| 1006 |
– |
return(0.0); |
| 1007 |
– |
/* allocate super-samples */ |
| 1008 |
– |
if (hemi.ns > 0 || pg != NULL || dg != NULL) { |
| 1009 |
– |
div = (AMBSAMP *)malloc(divcnt*sizeof(AMBSAMP)); |
| 1010 |
– |
if (div == NULL) |
| 1011 |
– |
error(SYSTEM, "out of memory in doambient"); |
| 1012 |
– |
} else |
| 1013 |
– |
div = NULL; |
| 1014 |
– |
/* sample the divisions */ |
| 1015 |
– |
arad = 0.0; |
| 1016 |
– |
acol[0] = acol[1] = acol[2] = 0.0; |
| 1017 |
– |
if ((dp = div) == NULL) |
| 1018 |
– |
dp = &dnew; |
| 1019 |
– |
divcnt = 0; |
| 1020 |
– |
for (i = 0; i < hemi.nt; i++) |
| 1021 |
– |
for (j = 0; j < hemi.np; j++) { |
| 1022 |
– |
dp->t = i; dp->p = j; |
| 1023 |
– |
setcolor(dp->v, 0.0, 0.0, 0.0); |
| 1024 |
– |
dp->r = 0.0; |
| 1025 |
– |
dp->n = 0; |
| 1026 |
– |
if (divsample(dp, &hemi, r) < 0) { |
| 1027 |
– |
if (div != NULL) |
| 1028 |
– |
dp++; |
| 1029 |
– |
continue; |
| 1030 |
– |
} |
| 1031 |
– |
arad += dp->r; |
| 1032 |
– |
divcnt++; |
| 1033 |
– |
if (div != NULL) |
| 1034 |
– |
dp++; |
| 1035 |
– |
else |
| 1036 |
– |
addcolor(acol, dp->v); |
| 1037 |
– |
} |
| 1038 |
– |
if (!divcnt) { |
| 1039 |
– |
if (div != NULL) |
| 1040 |
– |
free((void *)div); |
| 1041 |
– |
return(0.0); /* no samples taken */ |
| 1042 |
– |
} |
| 1043 |
– |
if (divcnt < hemi.nt*hemi.np) { |
| 1044 |
– |
pg = dg = NULL; /* incomplete sampling */ |
| 1045 |
– |
hemi.ns = 0; |
| 1046 |
– |
} else if (arad > FTINY && divcnt/arad < minarad) { |
| 1047 |
– |
hemi.ns = 0; /* close enough */ |
| 1048 |
– |
} else if (hemi.ns > 0) { /* else perform super-sampling? */ |
| 1049 |
– |
comperrs(div, &hemi); /* compute errors */ |
| 1050 |
– |
qsort(div, divcnt, sizeof(AMBSAMP), ambcmp); /* sort divs */ |
| 1051 |
– |
/* super-sample */ |
| 1052 |
– |
for (i = hemi.ns; i > 0; i--) { |
| 1053 |
– |
dnew = *div; |
| 1054 |
– |
if (divsample(&dnew, &hemi, r) < 0) { |
| 1055 |
– |
dp++; |
| 1056 |
– |
continue; |
| 1057 |
– |
} |
| 1058 |
– |
dp = div; /* reinsert */ |
| 1059 |
– |
j = divcnt < i ? divcnt : i; |
| 1060 |
– |
while (--j > 0 && dnew.k < dp[1].k) { |
| 1061 |
– |
*dp = *(dp+1); |
| 1062 |
– |
dp++; |
| 1063 |
– |
} |
| 1064 |
– |
*dp = dnew; |
| 1065 |
– |
} |
| 1066 |
– |
if (pg != NULL || dg != NULL) /* restore order */ |
| 1067 |
– |
qsort(div, divcnt, sizeof(AMBSAMP), ambnorm); |
| 1068 |
– |
} |
| 1069 |
– |
/* compute returned values */ |
| 1070 |
– |
if (div != NULL) { |
| 1071 |
– |
arad = 0.0; /* note: divcnt may be < nt*np */ |
| 1072 |
– |
for (i = hemi.nt*hemi.np, dp = div; i-- > 0; dp++) { |
| 1073 |
– |
arad += dp->r; |
| 1074 |
– |
if (dp->n > 1) { |
| 1075 |
– |
b = 1.0/dp->n; |
| 1076 |
– |
scalecolor(dp->v, b); |
| 1077 |
– |
dp->r *= b; |
| 1078 |
– |
dp->n = 1; |
| 1079 |
– |
} |
| 1080 |
– |
addcolor(acol, dp->v); |
| 1081 |
– |
} |
| 1082 |
– |
b = bright(acol); |
| 1083 |
– |
if (b > FTINY) { |
| 1084 |
– |
b = 1.0/b; /* compute & normalize gradient(s) */ |
| 1085 |
– |
if (pg != NULL) { |
| 1086 |
– |
posgradient(pg, div, &hemi); |
| 1087 |
– |
for (i = 0; i < 3; i++) |
| 1088 |
– |
pg[i] *= b; |
| 1089 |
– |
} |
| 1090 |
– |
if (dg != NULL) { |
| 1091 |
– |
dirgradient(dg, div, &hemi); |
| 1092 |
– |
for (i = 0; i < 3; i++) |
| 1093 |
– |
dg[i] *= b; |
| 1094 |
– |
} |
| 1095 |
– |
} |
| 1096 |
– |
free((void *)div); |
| 1097 |
– |
} |
| 1098 |
– |
copycolor(rcol, acol); |
| 1099 |
– |
if (arad <= FTINY) |
| 1100 |
– |
arad = maxarad; |
| 1101 |
– |
else |
| 1102 |
– |
arad = (divcnt+hemi.ns)/arad; |
| 1103 |
– |
if (pg != NULL) { /* reduce radius if gradient large */ |
| 1104 |
– |
d = DOT(pg,pg); |
| 1105 |
– |
if (d*arad*arad > 1.0) |
| 1106 |
– |
arad = 1.0/sqrt(d); |
| 1107 |
– |
} |
| 1108 |
– |
if (arad < minarad) { |
| 1109 |
– |
arad = minarad; |
| 1110 |
– |
if (pg != NULL && d*arad*arad > 1.0) { /* cap gradient */ |
| 1111 |
– |
d = 1.0/arad/sqrt(d); |
| 1112 |
– |
for (i = 0; i < 3; i++) |
| 1113 |
– |
pg[i] *= d; |
| 1114 |
– |
} |
| 1115 |
– |
} |
| 1116 |
– |
if ((arad /= sqrt(wt)) > maxarad) |
| 1117 |
– |
arad = maxarad; |
| 1118 |
– |
return(arad); |
| 1119 |
– |
} |
| 1120 |
– |
|
| 1121 |
– |
|
| 1122 |
– |
void |
| 1123 |
– |
comperrs( /* compute initial error estimates */ |
| 1124 |
– |
AMBSAMP *da, /* assumes standard ordering */ |
| 1125 |
– |
AMBHEMI *hp |
| 1126 |
– |
) |
| 1127 |
– |
{ |
| 1128 |
– |
double b, b2; |
| 1129 |
– |
int i, j; |
| 1130 |
– |
AMBSAMP *dp; |
| 1131 |
– |
/* sum differences from neighbors */ |
| 1132 |
– |
dp = da; |
| 1133 |
– |
for (i = 0; i < hp->nt; i++) |
| 1134 |
– |
for (j = 0; j < hp->np; j++) { |
| 1135 |
– |
#ifdef DEBUG |
| 1136 |
– |
if (dp->t != i || dp->p != j) |
| 1137 |
– |
error(CONSISTENCY, |
| 1138 |
– |
"division order in comperrs"); |
| 1139 |
– |
#endif |
| 1140 |
– |
b = bright(dp[0].v); |
| 1141 |
– |
if (i > 0) { /* from above */ |
| 1142 |
– |
b2 = bright(dp[-hp->np].v) - b; |
| 1143 |
– |
b2 *= b2 * 0.25; |
| 1144 |
– |
dp[0].k += b2; |
| 1145 |
– |
dp[-hp->np].k += b2; |
| 1146 |
– |
} |
| 1147 |
– |
if (j > 0) { /* from behind */ |
| 1148 |
– |
b2 = bright(dp[-1].v) - b; |
| 1149 |
– |
b2 *= b2 * 0.25; |
| 1150 |
– |
dp[0].k += b2; |
| 1151 |
– |
dp[-1].k += b2; |
| 1152 |
– |
} else { /* around */ |
| 1153 |
– |
b2 = bright(dp[hp->np-1].v) - b; |
| 1154 |
– |
b2 *= b2 * 0.25; |
| 1155 |
– |
dp[0].k += b2; |
| 1156 |
– |
dp[hp->np-1].k += b2; |
| 1157 |
– |
} |
| 1158 |
– |
dp++; |
| 1159 |
– |
} |
| 1160 |
– |
/* divide by number of neighbors */ |
| 1161 |
– |
dp = da; |
| 1162 |
– |
for (j = 0; j < hp->np; j++) /* top row */ |
| 1163 |
– |
(dp++)->k *= 1.0/3.0; |
| 1164 |
– |
if (hp->nt < 2) |
| 1165 |
– |
return; |
| 1166 |
– |
for (i = 1; i < hp->nt-1; i++) /* central region */ |
| 1167 |
– |
for (j = 0; j < hp->np; j++) |
| 1168 |
– |
(dp++)->k *= 0.25; |
| 1169 |
– |
for (j = 0; j < hp->np; j++) /* bottom row */ |
| 1170 |
– |
(dp++)->k *= 1.0/3.0; |
| 1171 |
– |
} |
| 1172 |
– |
|
| 1173 |
– |
|
| 1174 |
– |
void |
| 1175 |
– |
posgradient( /* compute position gradient */ |
| 1176 |
– |
FVECT gv, |
| 1177 |
– |
AMBSAMP *da, /* assumes standard ordering */ |
| 1178 |
– |
AMBHEMI *hp |
| 1179 |
– |
) |
| 1180 |
– |
{ |
| 1181 |
– |
int i, j; |
| 1182 |
– |
double nextsine, lastsine, b, d; |
| 1183 |
– |
double mag0, mag1; |
| 1184 |
– |
double phi, cosp, sinp, xd, yd; |
| 1185 |
– |
AMBSAMP *dp; |
| 1186 |
– |
|
| 1187 |
– |
xd = yd = 0.0; |
| 1188 |
– |
for (j = 0; j < hp->np; j++) { |
| 1189 |
– |
dp = da + j; |
| 1190 |
– |
mag0 = mag1 = 0.0; |
| 1191 |
– |
lastsine = 0.0; |
| 1192 |
– |
for (i = 0; i < hp->nt; i++) { |
| 1193 |
– |
#ifdef DEBUG |
| 1194 |
– |
if (dp->t != i || dp->p != j) |
| 1195 |
– |
error(CONSISTENCY, |
| 1196 |
– |
"division order in posgradient"); |
| 1197 |
– |
#endif |
| 1198 |
– |
b = bright(dp->v); |
| 1199 |
– |
if (i > 0) { |
| 1200 |
– |
d = dp[-hp->np].r; |
| 1201 |
– |
if (dp[0].r > d) d = dp[0].r; |
| 1202 |
– |
/* sin(t)*cos(t)^2 */ |
| 1203 |
– |
d *= lastsine * (1.0 - (double)i/hp->nt); |
| 1204 |
– |
mag0 += d*(b - bright(dp[-hp->np].v)); |
| 1205 |
– |
} |
| 1206 |
– |
nextsine = sqrt((double)(i+1)/hp->nt); |
| 1207 |
– |
if (j > 0) { |
| 1208 |
– |
d = dp[-1].r; |
| 1209 |
– |
if (dp[0].r > d) d = dp[0].r; |
| 1210 |
– |
mag1 += d * (nextsine - lastsine) * |
| 1211 |
– |
(b - bright(dp[-1].v)); |
| 1212 |
– |
} else { |
| 1213 |
– |
d = dp[hp->np-1].r; |
| 1214 |
– |
if (dp[0].r > d) d = dp[0].r; |
| 1215 |
– |
mag1 += d * (nextsine - lastsine) * |
| 1216 |
– |
(b - bright(dp[hp->np-1].v)); |
| 1217 |
– |
} |
| 1218 |
– |
dp += hp->np; |
| 1219 |
– |
lastsine = nextsine; |
| 1220 |
– |
} |
| 1221 |
– |
mag0 *= 2.0*PI / hp->np; |
| 1222 |
– |
phi = 2.0*PI * (double)j/hp->np; |
| 1223 |
– |
cosp = tcos(phi); sinp = tsin(phi); |
| 1224 |
– |
xd += mag0*cosp - mag1*sinp; |
| 1225 |
– |
yd += mag0*sinp + mag1*cosp; |
| 1226 |
– |
} |
| 1227 |
– |
for (i = 0; i < 3; i++) |
| 1228 |
– |
gv[i] = (xd*hp->ux[i] + yd*hp->uy[i])*(hp->nt*hp->np)/PI; |
| 1229 |
– |
} |
| 1230 |
– |
|
| 1231 |
– |
|
| 1232 |
– |
void |
| 1233 |
– |
dirgradient( /* compute direction gradient */ |
| 1234 |
– |
FVECT gv, |
| 1235 |
– |
AMBSAMP *da, /* assumes standard ordering */ |
| 1236 |
– |
AMBHEMI *hp |
| 1237 |
– |
) |
| 1238 |
– |
{ |
| 1239 |
– |
int i, j; |
| 1240 |
– |
double mag; |
| 1241 |
– |
double phi, xd, yd; |
| 1242 |
– |
AMBSAMP *dp; |
| 1243 |
– |
|
| 1244 |
– |
xd = yd = 0.0; |
| 1245 |
– |
for (j = 0; j < hp->np; j++) { |
| 1246 |
– |
dp = da + j; |
| 1247 |
– |
mag = 0.0; |
| 1248 |
– |
for (i = 0; i < hp->nt; i++) { |
| 1249 |
– |
#ifdef DEBUG |
| 1250 |
– |
if (dp->t != i || dp->p != j) |
| 1251 |
– |
error(CONSISTENCY, |
| 1252 |
– |
"division order in dirgradient"); |
| 1253 |
– |
#endif |
| 1254 |
– |
/* tan(t) */ |
| 1255 |
– |
mag += bright(dp->v)/sqrt(hp->nt/(i+.5) - 1.0); |
| 1256 |
– |
dp += hp->np; |
| 1257 |
– |
} |
| 1258 |
– |
phi = 2.0*PI * (j+.5)/hp->np + PI/2.0; |
| 1259 |
– |
xd += mag * tcos(phi); |
| 1260 |
– |
yd += mag * tsin(phi); |
| 1261 |
– |
} |
| 1262 |
– |
for (i = 0; i < 3; i++) |
| 1263 |
– |
gv[i] = xd*hp->ux[i] + yd*hp->uy[i]; |
| 1264 |
– |
} |
| 1265 |
– |
|
| 1266 |
– |
#endif /* ! NEWAMB */ |
