| 14 |
|
#ifndef LFREEPCT |
| 15 |
|
#define LFREEPCT 25 |
| 16 |
|
#endif |
| 17 |
+ |
/* maximum allowed angle difference (deg.) */ |
| 18 |
+ |
#ifndef MAXANG |
| 19 |
+ |
#define MAXANG 20 |
| 20 |
+ |
#endif |
| 21 |
+ |
#if MAXANG>0 |
| 22 |
+ |
#define MAXDIFF2 ( MAXANG*MAXANG * (PI*PI/180./180.)) |
| 23 |
+ |
#endif |
| 24 |
|
|
| 25 |
+ |
#define abs(i) ((i) < 0 ? -(i) : (i)) |
| 26 |
+ |
|
| 27 |
|
RTREE qtrunk; /* our quadtree trunk */ |
| 28 |
< |
double qtDepthEps = .02; /* epsilon to compare depths (z fraction) */ |
| 28 |
> |
double qtDepthEps = .05; /* epsilon to compare depths (z fraction) */ |
| 29 |
|
int qtMinNodesiz = 2; /* minimum node dimension (pixels) */ |
| 30 |
|
struct rleaves qtL; /* our pile of leaves */ |
| 31 |
|
|
| 32 |
+ |
static int4 falleaves; /* our list of fallen leaves */ |
| 33 |
+ |
|
| 34 |
+ |
#define composted(li) (qtL.bl <= qtL.tl ? \ |
| 35 |
+ |
((li) < qtL.bl || (li) >= qtL.tl) : \ |
| 36 |
+ |
((li) < qtL.bl && (li) >= qtL.tl)) |
| 37 |
+ |
|
| 38 |
|
#define TBUNDLESIZ 409 /* number of twigs in a bundle */ |
| 39 |
|
|
| 40 |
|
static RTREE **twigbundle; /* free twig blocks (NULL term.) */ |
| 93 |
|
} |
| 94 |
|
|
| 95 |
|
|
| 96 |
< |
static int |
| 97 |
< |
newleaf() /* allocate a leaf from our pile */ |
| 83 |
< |
{ |
| 84 |
< |
int li; |
| 85 |
< |
|
| 86 |
< |
li = qtL.tl++; |
| 87 |
< |
if (qtL.tl >= qtL.nl) /* get next leaf in ring */ |
| 88 |
< |
qtL.tl = 0; |
| 89 |
< |
if (qtL.tl == qtL.bl) /* need to shake some free */ |
| 90 |
< |
qtCompost(LFREEPCT); |
| 91 |
< |
return(li); |
| 92 |
< |
} |
| 96 |
> |
#define LEAFSIZ (3*sizeof(float)+sizeof(int4)+\ |
| 97 |
> |
sizeof(TMbright)+6*sizeof(BYTE)) |
| 98 |
|
|
| 94 |
– |
|
| 95 |
– |
#define LEAFSIZ (3*sizeof(float)+sizeof(TMbright)+6*sizeof(BYTE)) |
| 96 |
– |
|
| 99 |
|
int |
| 100 |
|
qtAllocLeaves(n) /* allocate space for n leaves */ |
| 101 |
|
register int n; |
| 120 |
|
return(0); |
| 121 |
|
/* assign larger alignment types earlier */ |
| 122 |
|
qtL.wp = (float (*)[3])qtL.base; |
| 123 |
< |
qtL.brt = (TMbright *)(qtL.wp + n); |
| 123 |
> |
qtL.wd = (int4 *)(qtL.wp + n); |
| 124 |
> |
qtL.brt = (TMbright *)(qtL.wd + n); |
| 125 |
|
qtL.chr = (BYTE (*)[3])(qtL.brt + n); |
| 126 |
|
qtL.rgb = (BYTE (*)[3])(qtL.chr + n); |
| 127 |
|
qtL.nl = n; |
| 128 |
|
qtL.tml = qtL.bl = qtL.tl = 0; |
| 129 |
+ |
falleaves = -1; |
| 130 |
|
return(n); |
| 131 |
|
} |
| 132 |
|
|
| 157 |
|
tp->flgs &= ~BRF(i); |
| 158 |
|
} else if (tp->flgs & LFF(i)) { |
| 159 |
|
li = tp->k[i].li; |
| 160 |
< |
if (qtL.bl < qtL.tl ? |
| 157 |
< |
(li < qtL.bl || li >= qtL.tl) : |
| 158 |
< |
(li < qtL.bl && li >= qtL.tl)) |
| 160 |
> |
if (composted(li)) |
| 161 |
|
tp->flgs &= ~LFF(i); |
| 162 |
|
} |
| 163 |
|
} |
| 167 |
|
qtCompost(pct) /* free up some leaves */ |
| 168 |
|
int pct; |
| 169 |
|
{ |
| 170 |
+ |
register int4 *fl; |
| 171 |
|
int nused, nclear, nmapped; |
| 169 |
– |
|
| 172 |
|
/* figure out how many leaves to clear */ |
| 173 |
|
nclear = qtL.nl * pct / 100; |
| 174 |
|
nused = qtL.tl - qtL.bl; |
| 179 |
|
if (nclear >= nused) { /* clear them all */ |
| 180 |
|
qtFreeTree(0); |
| 181 |
|
qtL.tml = qtL.bl = qtL.tl = 0; |
| 182 |
+ |
falleaves = -1; |
| 183 |
|
return(nused); |
| 184 |
|
} |
| 185 |
|
/* else clear leaves from bottom */ |
| 188 |
|
qtL.bl += nclear; |
| 189 |
|
if (qtL.bl >= qtL.nl) qtL.bl -= qtL.nl; |
| 190 |
|
if (nmapped <= nclear) qtL.tml = qtL.bl; |
| 191 |
< |
shaketree(&qtrunk); |
| 191 |
> |
shaketree(&qtrunk); /* dereference composted leaves */ |
| 192 |
> |
for (fl = &falleaves; *fl >= 0; fl = qtL.wd + *fl) |
| 193 |
> |
while (composted(*fl)) |
| 194 |
> |
if ((*fl = qtL.wd[*fl]) < 0) |
| 195 |
> |
return(nclear); |
| 196 |
|
return(nclear); |
| 197 |
|
} |
| 198 |
|
|
| 235 |
|
|
| 236 |
|
|
| 237 |
|
static |
| 238 |
< |
addleaf(li) /* add a leaf to our tree */ |
| 239 |
< |
int li; |
| 238 |
> |
putleaf(li, drop) /* put a leaf in our tree */ |
| 239 |
> |
register int li; |
| 240 |
> |
int drop; |
| 241 |
|
{ |
| 242 |
|
register RTREE *tp = &qtrunk; |
| 243 |
|
int x0=0, y0=0, x1=odev.hres, y1=odev.vres; |
| 244 |
< |
int lo = -1; |
| 244 |
> |
register int lo = -1; |
| 245 |
> |
double d2; |
| 246 |
|
int x, y, mx, my; |
| 247 |
|
double z; |
| 248 |
< |
FVECT ip, wp; |
| 248 |
> |
FVECT ip, wp, vd; |
| 249 |
|
register int q; |
| 250 |
< |
/* compute leaf location */ |
| 250 |
> |
/* check for dead leaf */ |
| 251 |
> |
if (!qtL.chr[li][1] && !(qtL.chr[li][0] | qtL.chr[li][2])) |
| 252 |
> |
return(0); |
| 253 |
> |
/* compute leaf location in view */ |
| 254 |
|
VCOPY(wp, qtL.wp[li]); |
| 255 |
|
viewloc(ip, &odev.v, wp); |
| 256 |
|
if (ip[2] <= 0. || ip[0] < 0. || ip[0] >= 1. |
| 257 |
|
|| ip[1] < 0. || ip[1] >= 1.) |
| 258 |
< |
return; |
| 258 |
> |
goto dropit; /* behind or outside view */ |
| 259 |
> |
#ifdef DEBUG |
| 260 |
> |
if (odev.v.type == VT_PAR | odev.v.vfore > FTINY) |
| 261 |
> |
error(INTERNAL, "bad view assumption in putleaf"); |
| 262 |
> |
#endif |
| 263 |
> |
for (q = 0; q < 3; q++) |
| 264 |
> |
vd[q] = (wp[q] - odev.v.vp[q])/ip[2]; |
| 265 |
> |
d2 = fdir2diff(qtL.wd[li], vd); |
| 266 |
> |
#ifdef MAXDIFF2 |
| 267 |
> |
if (d2 > MAXDIFF2) |
| 268 |
> |
goto dropit; /* leaf dir. too far off */ |
| 269 |
> |
#endif |
| 270 |
|
x = ip[0] * odev.hres; |
| 271 |
|
y = ip[1] * odev.vres; |
| 272 |
|
z = ip[2]; |
| 287 |
|
if (!(tp->flgs & LFF(q))) { /* found stem for leaf */ |
| 288 |
|
tp->k[q].li = li; |
| 289 |
|
tp->flgs |= CHLFF(q); |
| 290 |
< |
break; |
| 290 |
> |
return(1); |
| 291 |
|
} |
| 292 |
< |
/* check existing leaf */ |
| 270 |
< |
if (lo != tp->k[q].li) { |
| 292 |
> |
if (lo != tp->k[q].li) { /* check old leaf */ |
| 293 |
|
lo = tp->k[q].li; |
| 294 |
|
VCOPY(wp, qtL.wp[lo]); |
| 295 |
|
viewloc(ip, &odev.v, wp); |
| 296 |
|
} |
| 297 |
|
/* is node minimum size? */ |
| 298 |
< |
if (x1-x0 <= qtMinNodesiz || y1-y0 <= qtMinNodesiz) { |
| 299 |
< |
if (z > (1.-qtDepthEps)*ip[2]) /* who is closer? */ |
| 300 |
< |
return; /* old one is */ |
| 301 |
< |
tp->k[q].li = li; /* new one is */ |
| 298 |
> |
if (y1-y0 <= qtMinNodesiz || x1-x0 <= qtMinNodesiz) { |
| 299 |
> |
if (z > (1.+qtDepthEps)*ip[2]) |
| 300 |
> |
break; /* old one closer */ |
| 301 |
> |
if (z >= (1.-qtDepthEps)*ip[2] && |
| 302 |
> |
fdir2diff(qtL.wd[lo], vd) < d2) |
| 303 |
> |
break; /* old one better */ |
| 304 |
> |
tp->k[q].li = li; /* attach new */ |
| 305 |
|
tp->flgs |= CHF(q); |
| 306 |
+ |
li = lo; /* drop old... */ |
| 307 |
|
break; |
| 308 |
|
} |
| 309 |
|
tp->flgs &= ~LFF(q); /* else grow tree */ |
| 314 |
|
my = ip[1] * odev.vres; |
| 315 |
|
if (mx >= (x0 + x1) >> 1) q |= 01; |
| 316 |
|
if (my >= (y0 + y1) >> 1) q |= 02; |
| 317 |
+ |
tp->flgs = CH_ANY|LFF(q); /* all new */ |
| 318 |
|
tp->k[q].li = lo; |
| 292 |
– |
tp->flgs |= LFF(q)|CH_ANY; /* all new */ |
| 319 |
|
} |
| 320 |
+ |
dropit: |
| 321 |
+ |
if (drop) |
| 322 |
+ |
if (li+1 == (qtL.tl ? qtL.tl : qtL.nl)) |
| 323 |
+ |
qtL.tl = li; /* special case */ |
| 324 |
+ |
else { |
| 325 |
+ |
qtL.chr[li][0] = qtL.chr[li][1] = qtL.chr[li][2] = 0; |
| 326 |
+ |
qtL.wd[li] = falleaves; |
| 327 |
+ |
falleaves = li; |
| 328 |
+ |
} |
| 329 |
+ |
return(li == lo); |
| 330 |
|
} |
| 331 |
|
|
| 332 |
|
|
| 333 |
< |
dev_value(c, p) /* add a pixel value to our quadtree */ |
| 333 |
> |
dev_value(c, p, v) /* add a pixel value to our quadtree */ |
| 334 |
|
COLR c; |
| 335 |
< |
FVECT p; |
| 335 |
> |
FVECT p, v; |
| 336 |
|
{ |
| 337 |
|
register int li; |
| 338 |
< |
|
| 339 |
< |
li = newleaf(); |
| 338 |
> |
int mapit; |
| 339 |
> |
/* grab a leaf */ |
| 340 |
> |
if (!imm_mode && falleaves >= 0) { /* check for fallen leaves */ |
| 341 |
> |
li = falleaves; |
| 342 |
> |
falleaves = qtL.wd[li]; |
| 343 |
> |
mapit = qtL.tml <= qtL.tl ? |
| 344 |
> |
(li < qtL.tml || li >= qtL.tl) : |
| 345 |
> |
(li < qtL.tml && li >= qtL.tl) ; |
| 346 |
> |
} else { /* else allocate new one */ |
| 347 |
> |
li = qtL.tl++; |
| 348 |
> |
if (qtL.tl >= qtL.nl) /* next leaf in ring */ |
| 349 |
> |
qtL.tl = 0; |
| 350 |
> |
if (qtL.tl == qtL.bl) /* need to shake some free */ |
| 351 |
> |
qtCompost(LFREEPCT); |
| 352 |
> |
mapit = 0; /* we'll map it later */ |
| 353 |
> |
} |
| 354 |
|
VCOPY(qtL.wp[li], p); |
| 355 |
+ |
qtL.wd[li] = encodedir(v); |
| 356 |
|
tmCvColrs(&qtL.brt[li], qtL.chr[li], c, 1); |
| 357 |
< |
addleaf(li); |
| 357 |
> |
if (putleaf(li, 1) && mapit) |
| 358 |
> |
tmMapPixels(qtL.rgb+li, qtL.brt+li, qtL.chr+li, 1); |
| 359 |
|
} |
| 360 |
|
|
| 361 |
|
|
| 368 |
|
qtFreeTree(0); /* blow the old tree away */ |
| 369 |
|
/* regrow it in new place */ |
| 370 |
|
for (i = qtL.bl; i != qtL.tl; ) { |
| 371 |
< |
addleaf(i); |
| 371 |
> |
putleaf(i, 0); |
| 372 |
|
if (++i >= qtL.nl) i = 0; |
| 373 |
|
} |
| 374 |
|
} |
