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 |
+ |
int rayqleft = 0; /* rays left to queue before flush */ |
33 |
+ |
|
34 |
+ |
static int4 falleaves; /* our list of fallen leaves */ |
35 |
+ |
|
36 |
+ |
#define composted(li) (qtL.bl <= qtL.tl ? \ |
37 |
+ |
((li) < qtL.bl || (li) >= qtL.tl) : \ |
38 |
+ |
((li) < qtL.bl && (li) >= qtL.tl)) |
39 |
+ |
|
40 |
|
#define TBUNDLESIZ 409 /* number of twigs in a bundle */ |
41 |
|
|
42 |
|
static RTREE **twigbundle; /* free twig blocks (NULL term.) */ |
43 |
|
static int nexttwig; /* next free twig */ |
44 |
|
|
28 |
– |
#define is_stump(t) (!((t)->flgs & (BR_ANY|LF_ANY))) |
45 |
|
|
30 |
– |
|
46 |
|
static RTREE * |
47 |
|
newtwig() /* allocate a twig */ |
48 |
|
{ |
95 |
|
} |
96 |
|
|
97 |
|
|
98 |
< |
static int |
99 |
< |
newleaf() /* allocate a leaf from our pile */ |
85 |
< |
{ |
86 |
< |
int li; |
87 |
< |
|
88 |
< |
li = qtL.tl++; |
89 |
< |
if (qtL.tl >= qtL.nl) /* get next leaf in ring */ |
90 |
< |
qtL.tl = 0; |
91 |
< |
if (qtL.tl == qtL.bl) /* need to shake some free */ |
92 |
< |
qtCompost(LFREEPCT); |
93 |
< |
return(li); |
94 |
< |
} |
98 |
> |
#define LEAFSIZ (3*sizeof(float)+sizeof(int4)+\ |
99 |
> |
sizeof(TMbright)+6*sizeof(BYTE)) |
100 |
|
|
96 |
– |
|
97 |
– |
#define LEAFSIZ (3*sizeof(float)+sizeof(TMbright)+6*sizeof(BYTE)) |
98 |
– |
|
101 |
|
int |
102 |
|
qtAllocLeaves(n) /* allocate space for n leaves */ |
103 |
|
register int n; |
122 |
|
return(0); |
123 |
|
/* assign larger alignment types earlier */ |
124 |
|
qtL.wp = (float (*)[3])qtL.base; |
125 |
< |
qtL.brt = (TMbright *)(qtL.wp + n); |
125 |
> |
qtL.wd = (int4 *)(qtL.wp + n); |
126 |
> |
qtL.brt = (TMbright *)(qtL.wd + n); |
127 |
|
qtL.chr = (BYTE (*)[3])(qtL.brt + n); |
128 |
|
qtL.rgb = (BYTE (*)[3])(qtL.chr + n); |
129 |
|
qtL.nl = n; |
130 |
|
qtL.tml = qtL.bl = qtL.tl = 0; |
131 |
+ |
falleaves = -1; |
132 |
|
return(n); |
133 |
|
} |
134 |
|
|
159 |
|
tp->flgs &= ~BRF(i); |
160 |
|
} else if (tp->flgs & LFF(i)) { |
161 |
|
li = tp->k[i].li; |
162 |
< |
if (qtL.bl < qtL.tl ? |
159 |
< |
(li < qtL.bl || li >= qtL.tl) : |
160 |
< |
(li < qtL.bl && li >= qtL.tl)) |
162 |
> |
if (composted(li)) |
163 |
|
tp->flgs &= ~LFF(i); |
164 |
|
} |
165 |
|
} |
169 |
|
qtCompost(pct) /* free up some leaves */ |
170 |
|
int pct; |
171 |
|
{ |
172 |
+ |
register int4 *fl; |
173 |
|
int nused, nclear, nmapped; |
171 |
– |
|
174 |
|
/* figure out how many leaves to clear */ |
175 |
|
nclear = qtL.nl * pct / 100; |
176 |
|
nused = qtL.tl - qtL.bl; |
181 |
|
if (nclear >= nused) { /* clear them all */ |
182 |
|
qtFreeTree(0); |
183 |
|
qtL.tml = qtL.bl = qtL.tl = 0; |
184 |
+ |
falleaves = -1; |
185 |
|
return(nused); |
186 |
|
} |
187 |
|
/* else clear leaves from bottom */ |
190 |
|
qtL.bl += nclear; |
191 |
|
if (qtL.bl >= qtL.nl) qtL.bl -= qtL.nl; |
192 |
|
if (nmapped <= nclear) qtL.tml = qtL.bl; |
193 |
< |
shaketree(&qtrunk); |
193 |
> |
shaketree(&qtrunk); /* dereference composted leaves */ |
194 |
> |
for (fl = &falleaves; *fl >= 0; fl = qtL.wd + *fl) |
195 |
> |
while (composted(*fl)) |
196 |
> |
if ((*fl = qtL.wd[*fl]) < 0) |
197 |
> |
return(nclear); |
198 |
|
return(nclear); |
199 |
|
} |
200 |
|
|
237 |
|
|
238 |
|
|
239 |
|
static |
240 |
< |
addleaf(li) /* add a leaf to our tree */ |
241 |
< |
int li; |
240 |
> |
putleaf(li, drop) /* put a leaf in our tree */ |
241 |
> |
register int li; |
242 |
> |
int drop; |
243 |
|
{ |
244 |
|
register RTREE *tp = &qtrunk; |
245 |
|
int x0=0, y0=0, x1=odev.hres, y1=odev.vres; |
246 |
< |
int lo = -1; |
246 |
> |
register int lo = -1; |
247 |
> |
double d2; |
248 |
|
int x, y, mx, my; |
249 |
|
double z; |
250 |
< |
FVECT ip, wp; |
250 |
> |
FVECT ip, wp, vd; |
251 |
|
register int q; |
252 |
< |
/* compute leaf location */ |
252 |
> |
/* check for dead leaf */ |
253 |
> |
if (!qtL.chr[li][1] && !(qtL.chr[li][0] | qtL.chr[li][2])) |
254 |
> |
return(0); |
255 |
> |
/* compute leaf location in view */ |
256 |
|
VCOPY(wp, qtL.wp[li]); |
257 |
|
viewloc(ip, &odev.v, wp); |
258 |
|
if (ip[2] <= 0. || ip[0] < 0. || ip[0] >= 1. |
259 |
|
|| ip[1] < 0. || ip[1] >= 1.) |
260 |
< |
return; |
260 |
> |
goto dropit; /* behind or outside view */ |
261 |
> |
#ifdef DEBUG |
262 |
> |
if (odev.v.type == VT_PAR | odev.v.vfore > FTINY) |
263 |
> |
error(INTERNAL, "bad view assumption in putleaf"); |
264 |
> |
#endif |
265 |
> |
for (q = 0; q < 3; q++) |
266 |
> |
vd[q] = (wp[q] - odev.v.vp[q])/ip[2]; |
267 |
> |
d2 = fdir2diff(qtL.wd[li], vd); |
268 |
> |
#ifdef MAXDIFF2 |
269 |
> |
if (d2 > MAXDIFF2) |
270 |
> |
goto dropit; /* leaf dir. too far off */ |
271 |
> |
#endif |
272 |
|
x = ip[0] * odev.hres; |
273 |
|
y = ip[1] * odev.vres; |
274 |
|
z = ip[2]; |
289 |
|
if (!(tp->flgs & LFF(q))) { /* found stem for leaf */ |
290 |
|
tp->k[q].li = li; |
291 |
|
tp->flgs |= CHLFF(q); |
292 |
< |
break; |
292 |
> |
return(1); |
293 |
|
} |
294 |
< |
/* check existing leaf */ |
272 |
< |
if (lo != tp->k[q].li) { |
294 |
> |
if (lo != tp->k[q].li) { /* check old leaf */ |
295 |
|
lo = tp->k[q].li; |
296 |
|
VCOPY(wp, qtL.wp[lo]); |
297 |
|
viewloc(ip, &odev.v, wp); |
298 |
|
} |
299 |
|
/* is node minimum size? */ |
300 |
< |
if (x1-x0 <= qtMinNodesiz || y1-y0 <= qtMinNodesiz) { |
301 |
< |
if (z > (1.-qtDepthEps)*ip[2]) /* who is closer? */ |
302 |
< |
return; /* old one is */ |
303 |
< |
tp->k[q].li = li; /* new one is */ |
300 |
> |
if (y1-y0 <= qtMinNodesiz || x1-x0 <= qtMinNodesiz) { |
301 |
> |
if (z > (1.+qtDepthEps)*ip[2]) |
302 |
> |
break; /* old one closer */ |
303 |
> |
if (z >= (1.-qtDepthEps)*ip[2] && |
304 |
> |
fdir2diff(qtL.wd[lo], vd) < d2) |
305 |
> |
break; /* old one better */ |
306 |
> |
tp->k[q].li = li; /* attach new */ |
307 |
|
tp->flgs |= CHF(q); |
308 |
+ |
li = lo; /* drop old... */ |
309 |
|
break; |
310 |
|
} |
311 |
|
tp->flgs &= ~LFF(q); /* else grow tree */ |
316 |
|
my = ip[1] * odev.vres; |
317 |
|
if (mx >= (x0 + x1) >> 1) q |= 01; |
318 |
|
if (my >= (y0 + y1) >> 1) q |= 02; |
319 |
+ |
tp->flgs = CH_ANY|LFF(q); /* all new */ |
320 |
|
tp->k[q].li = lo; |
294 |
– |
tp->flgs |= LFF(q)|CH_ANY; /* all new */ |
321 |
|
} |
322 |
+ |
dropit: |
323 |
+ |
if (drop) |
324 |
+ |
if (li+1 == (qtL.tl ? qtL.tl : qtL.nl)) |
325 |
+ |
qtL.tl = li; /* special case */ |
326 |
+ |
else { |
327 |
+ |
qtL.chr[li][0] = qtL.chr[li][1] = qtL.chr[li][2] = 0; |
328 |
+ |
qtL.wd[li] = falleaves; |
329 |
+ |
falleaves = li; |
330 |
+ |
} |
331 |
+ |
return(li == lo); |
332 |
|
} |
333 |
|
|
334 |
|
|
335 |
< |
dev_value(c, p) /* add a pixel value to our output queue */ |
335 |
> |
dev_value(c, p, v) /* add a pixel value to our quadtree */ |
336 |
|
COLR c; |
337 |
< |
FVECT p; |
337 |
> |
FVECT p, v; |
338 |
|
{ |
339 |
|
register int li; |
340 |
< |
|
341 |
< |
li = newleaf(); |
340 |
> |
int mapit; |
341 |
> |
/* grab a leaf */ |
342 |
> |
if (!imm_mode && falleaves >= 0) { /* check for fallen leaves */ |
343 |
> |
li = falleaves; |
344 |
> |
falleaves = qtL.wd[li]; |
345 |
> |
mapit = qtL.tml <= qtL.tl ? |
346 |
> |
(li < qtL.tml || li >= qtL.tl) : |
347 |
> |
(li < qtL.tml && li >= qtL.tl) ; |
348 |
> |
} else { /* else allocate new one */ |
349 |
> |
li = qtL.tl++; |
350 |
> |
if (qtL.tl >= qtL.nl) /* next leaf in ring */ |
351 |
> |
qtL.tl = 0; |
352 |
> |
if (qtL.tl == qtL.bl) /* need to shake some free */ |
353 |
> |
qtCompost(LFREEPCT); |
354 |
> |
mapit = 0; /* we'll map it later */ |
355 |
> |
} |
356 |
|
VCOPY(qtL.wp[li], p); |
357 |
+ |
qtL.wd[li] = encodedir(v); |
358 |
|
tmCvColrs(&qtL.brt[li], qtL.chr[li], c, 1); |
359 |
< |
addleaf(li); |
359 |
> |
if (putleaf(li, 1)) { |
360 |
> |
if (mapit) |
361 |
> |
tmMapPixels(qtL.rgb+li, qtL.brt+li, qtL.chr+li, 1); |
362 |
> |
if (--rayqleft == 0) |
363 |
> |
dev_flush(); /* flush output */ |
364 |
> |
} |
365 |
|
} |
366 |
|
|
367 |
|
|
374 |
|
qtFreeTree(0); /* blow the old tree away */ |
375 |
|
/* regrow it in new place */ |
376 |
|
for (i = qtL.bl; i != qtL.tl; ) { |
377 |
< |
addleaf(i); |
377 |
> |
putleaf(i, 0); |
378 |
|
if (++i >= qtL.nl) i = 0; |
379 |
|
} |
380 |
|
} |
417 |
|
qtL.chr+borg, blen); |
418 |
|
qtL.tml = qtL.tl; |
419 |
|
return(1); |
364 |
– |
} |
365 |
– |
|
366 |
– |
|
367 |
– |
static |
368 |
– |
redraw(tp, x0, y0, x1, y1, l) /* mark portion of a tree for redraw */ |
369 |
– |
register RTREE *tp; |
370 |
– |
int x0, y0, x1, y1; |
371 |
– |
int l[2][2]; |
372 |
– |
{ |
373 |
– |
int quads = CH_ANY; |
374 |
– |
int mx, my; |
375 |
– |
register int i; |
376 |
– |
/* compute midpoint */ |
377 |
– |
mx = (x0 + x1) >> 1; |
378 |
– |
my = (y0 + y1) >> 1; |
379 |
– |
/* see what to do */ |
380 |
– |
if (l[0][0] >= mx) |
381 |
– |
quads &= ~(CHF(2)|CHF(0)); |
382 |
– |
else if (l[0][1] < mx) |
383 |
– |
quads &= ~(CHF(3)|CHF(1)); |
384 |
– |
if (l[1][0] >= my) |
385 |
– |
quads &= ~(CHF(1)|CHF(0)); |
386 |
– |
else if (l[1][1] < my) |
387 |
– |
quads &= ~(CHF(3)|CHF(2)); |
388 |
– |
tp->flgs |= quads; /* mark quadrants for update */ |
389 |
– |
/* climb the branches */ |
390 |
– |
for (i = 0; i < 4; i++) |
391 |
– |
if (tp->flgs & BRF(i) && quads & CHF(i)) |
392 |
– |
redraw(tp->k[i].b, i&01 ? mx : x0, i&02 ? my : y0, |
393 |
– |
i&01 ? x1 : mx, i&02 ? y1 : my, l); |
394 |
– |
} |
395 |
– |
|
396 |
– |
|
397 |
– |
static |
398 |
– |
update(ca, tp, x0, y0, x1, y1) /* update tree display as needed */ |
399 |
– |
BYTE ca[3]; /* returned average color */ |
400 |
– |
register RTREE *tp; |
401 |
– |
int x0, y0, x1, y1; |
402 |
– |
{ |
403 |
– |
int csm[3], nc; |
404 |
– |
register BYTE *cp; |
405 |
– |
BYTE rgb[3]; |
406 |
– |
int gaps = 0; |
407 |
– |
int mx, my; |
408 |
– |
register int i; |
409 |
– |
/* compute midpoint */ |
410 |
– |
mx = (x0 + x1) >> 1; |
411 |
– |
my = (y0 + y1) >> 1; |
412 |
– |
csm[0] = csm[1] = csm[2] = nc = 0; |
413 |
– |
/* do leaves first */ |
414 |
– |
for (i = 0; i < 4; i++) { |
415 |
– |
if (!(tp->flgs & CHF(i))) |
416 |
– |
continue; |
417 |
– |
if (tp->flgs & LFF(i)) { |
418 |
– |
dev_paintr(cp=qtL.rgb[tp->k[i].li], |
419 |
– |
i&01 ? mx : x0, i&02 ? my : y0, |
420 |
– |
i&01 ? x1 : mx, i&02 ? y1 : my); |
421 |
– |
csm[0] += cp[0]; csm[1] += cp[1]; csm[2] += cp[2]; |
422 |
– |
nc++; |
423 |
– |
} else if (!(tp->flgs & BRF(i))) |
424 |
– |
gaps |= 1<<i; /* empty stem */ |
425 |
– |
} |
426 |
– |
/* now do branches */ |
427 |
– |
for (i = 0; i < 4; i++) |
428 |
– |
if ((tp->flgs & CHBRF(i)) == CHBRF(i)) { |
429 |
– |
update(rgb, tp->k[i].b, i&01 ? mx : x0, i&02 ? my : y0, |
430 |
– |
i&01 ? x1 : mx, i&02 ? y1 : my); |
431 |
– |
csm[0] += rgb[0]; csm[1] += rgb[1]; csm[2] += rgb[2]; |
432 |
– |
nc++; |
433 |
– |
} |
434 |
– |
if (nc > 1) { |
435 |
– |
ca[0] = csm[0]/nc; ca[1] = csm[1]/nc; ca[2] = csm[2]/nc; |
436 |
– |
} else { |
437 |
– |
ca[0] = csm[0]; ca[1] = csm[1]; ca[2] = csm[2]; |
438 |
– |
} |
439 |
– |
/* fill in gaps with average */ |
440 |
– |
for (i = 0; gaps && i < 4; gaps >>= 1, i++) |
441 |
– |
if (gaps & 01) |
442 |
– |
dev_paintr(ca, i&01 ? mx : x0, i&02 ? my : y0, |
443 |
– |
i&01 ? x1 : mx, i&02 ? y1 : my); |
444 |
– |
tp->flgs &= ~CH_ANY; /* all done */ |
445 |
– |
} |
446 |
– |
|
447 |
– |
|
448 |
– |
qtRedraw(x0, y0, x1, y1) /* redraw part or all of our screen */ |
449 |
– |
int x0, y0, x1, y1; |
450 |
– |
{ |
451 |
– |
int lim[2][2]; |
452 |
– |
|
453 |
– |
if (is_stump(&qtrunk)) |
454 |
– |
return; |
455 |
– |
if (!qtMapLeaves((lim[0][0]=x0) <= 0 & (lim[1][0]=y0) <= 0 & |
456 |
– |
(lim[0][1]=x1) >= odev.hres-1 & (lim[1][1]=y1) >= odev.vres-1)) |
457 |
– |
return; |
458 |
– |
redraw(&qtrunk, 0, 0, odev.hres, odev.vres, lim); |
459 |
– |
} |
460 |
– |
|
461 |
– |
|
462 |
– |
qtUpdate() /* update our tree display */ |
463 |
– |
{ |
464 |
– |
BYTE ca[3]; |
465 |
– |
|
466 |
– |
if (is_stump(&qtrunk)) |
467 |
– |
return; |
468 |
– |
if (!qtMapLeaves(0)) |
469 |
– |
return; |
470 |
– |
update(ca, &qtrunk, 0, 0, odev.hres, odev.vres); |
420 |
|
} |