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 |
|
|
34 |
|
static RTREE **twigbundle; /* free twig blocks (NULL term.) */ |
35 |
|
static int nexttwig; /* next free twig */ |
36 |
|
|
37 |
< |
#define is_stump(t) (!((t)->flgs & (BR_ANY|LF_ANY))) |
37 |
> |
#define ungetleaf(li) (qtL.tl=(li)) /* dangerous if used improperly */ |
38 |
|
|
39 |
|
|
40 |
|
static RTREE * |
103 |
|
} |
104 |
|
|
105 |
|
|
106 |
< |
#define LEAFSIZ (3*sizeof(float)+sizeof(TMbright)+6*sizeof(BYTE)) |
106 |
> |
#define LEAFSIZ (3*sizeof(float)+sizeof(int4)+\ |
107 |
> |
sizeof(TMbright)+6*sizeof(BYTE)) |
108 |
|
|
109 |
|
int |
110 |
|
qtAllocLeaves(n) /* allocate space for n leaves */ |
130 |
|
return(0); |
131 |
|
/* assign larger alignment types earlier */ |
132 |
|
qtL.wp = (float (*)[3])qtL.base; |
133 |
< |
qtL.brt = (TMbright *)(qtL.wp + n); |
133 |
> |
qtL.wd = (int4 *)(qtL.wp + n); |
134 |
> |
qtL.brt = (TMbright *)(qtL.wd + n); |
135 |
|
qtL.chr = (BYTE (*)[3])(qtL.brt + n); |
136 |
|
qtL.rgb = (BYTE (*)[3])(qtL.chr + n); |
137 |
|
qtL.nl = n; |
203 |
|
} |
204 |
|
|
205 |
|
|
206 |
+ |
#define DCSCALE 11585.2 /* (1<<13)*sqrt(2) */ |
207 |
+ |
#define FXNEG 01 |
208 |
+ |
#define FYNEG 02 |
209 |
+ |
#define FZNEG 04 |
210 |
+ |
#define F1X 010 |
211 |
+ |
#define F2Z 020 |
212 |
+ |
#define F1SFT 5 |
213 |
+ |
#define F2SFT 18 |
214 |
+ |
#define FMASK 0x1fff |
215 |
+ |
|
216 |
+ |
static int4 |
217 |
+ |
encodedir(dv) /* encode a normalized direction vector */ |
218 |
+ |
FVECT dv; |
219 |
+ |
{ |
220 |
+ |
register int4 dc = 0; |
221 |
+ |
int cd[3], cm; |
222 |
+ |
register int i; |
223 |
+ |
|
224 |
+ |
for (i = 0; i < 3; i++) |
225 |
+ |
if (dv[i] < 0.) { |
226 |
+ |
cd[i] = dv[i] * -DCSCALE; |
227 |
+ |
dc |= 1<<i; |
228 |
+ |
} else |
229 |
+ |
cd[i] = dv[i] * DCSCALE; |
230 |
+ |
if (cd[0] <= cd[1]) { |
231 |
+ |
dc |= F1X | cd[0] << F1SFT; |
232 |
+ |
cm = cd[1]; |
233 |
+ |
} else { |
234 |
+ |
dc |= cd[1] << F1SFT; |
235 |
+ |
cm = cd[0]; |
236 |
+ |
} |
237 |
+ |
if (cd[2] <= cm) |
238 |
+ |
dc |= F2Z | cd[2] << F2SFT; |
239 |
+ |
else |
240 |
+ |
dc |= cm << F2SFT; |
241 |
+ |
return(dc); |
242 |
+ |
} |
243 |
+ |
|
244 |
+ |
|
245 |
+ |
static |
246 |
+ |
decodedir(dv, dc) /* decode a normalized direction vector */ |
247 |
+ |
register FVECT dv; /* returned */ |
248 |
+ |
register int4 dc; |
249 |
+ |
{ |
250 |
+ |
double d1, d2, der; |
251 |
+ |
|
252 |
+ |
d1 = ((dc>>F1SFT & FMASK)+.5)/DCSCALE; |
253 |
+ |
d2 = ((dc>>F2SFT & FMASK)+.5)/DCSCALE; |
254 |
+ |
der = sqrt(1. - d1*d1 - d2*d2); |
255 |
+ |
if (dc & F1X) { |
256 |
+ |
dv[0] = d1; |
257 |
+ |
if (dc & F2Z) { dv[1] = der; dv[2] = d2; } |
258 |
+ |
else { dv[1] = d2; dv[2] = der; } |
259 |
+ |
} else { |
260 |
+ |
dv[1] = d1; |
261 |
+ |
if (dc & F2Z) { dv[0] = der; dv[2] = d2; } |
262 |
+ |
else { dv[0] = d2; dv[2] = der; } |
263 |
+ |
} |
264 |
+ |
if (dc & FXNEG) dv[0] = -dv[0]; |
265 |
+ |
if (dc & FYNEG) dv[1] = -dv[1]; |
266 |
+ |
if (dc & FZNEG) dv[2] = -dv[2]; |
267 |
+ |
} |
268 |
+ |
|
269 |
+ |
|
270 |
+ |
static double |
271 |
+ |
dir2diff(dc1, dc2) /* relative radians^2 between directions */ |
272 |
+ |
int4 dc1, dc2; |
273 |
+ |
{ |
274 |
+ |
FVECT v1, v2; |
275 |
+ |
|
276 |
+ |
decodedir(v1, dc1); |
277 |
+ |
decodedir(v2, dc2); |
278 |
+ |
|
279 |
+ |
return(2. - 2.*DOT(v1,v2)); |
280 |
+ |
} |
281 |
+ |
|
282 |
+ |
|
283 |
+ |
static double |
284 |
+ |
fdir2diff(dc1, v2) /* relative radians^2 between directions */ |
285 |
+ |
int4 dc1; |
286 |
+ |
register FVECT v2; |
287 |
+ |
{ |
288 |
+ |
FVECT v1; |
289 |
+ |
|
290 |
+ |
decodedir(v1, dc1); |
291 |
+ |
|
292 |
+ |
return(2. - 2.*DOT(v1,v2)); |
293 |
+ |
} |
294 |
+ |
|
295 |
+ |
|
296 |
|
int |
297 |
|
qtFindLeaf(x, y) /* find closest leaf to (x,y) */ |
298 |
|
int x, y; |
337 |
|
register RTREE *tp = &qtrunk; |
338 |
|
int x0=0, y0=0, x1=odev.hres, y1=odev.vres; |
339 |
|
int lo = -1; |
340 |
+ |
double d2; |
341 |
|
int x, y, mx, my; |
342 |
|
double z; |
343 |
< |
FVECT ip, wp; |
343 |
> |
FVECT ip, wp, vd; |
344 |
|
register int q; |
345 |
< |
/* compute leaf location */ |
345 |
> |
/* compute leaf location in view */ |
346 |
|
VCOPY(wp, qtL.wp[li]); |
347 |
|
viewloc(ip, &odev.v, wp); |
348 |
|
if (ip[2] <= 0. || ip[0] < 0. || ip[0] >= 1. |
349 |
|
|| ip[1] < 0. || ip[1] >= 1.) |
350 |
< |
return; |
350 |
> |
return(-1); /* behind or outside view */ |
351 |
> |
#ifdef DEBUG |
352 |
> |
if (odev.v.type == VT_PAR | odev.v.vfore > FTINY) |
353 |
> |
error(INTERNAL, "bad view assumption in addleaf"); |
354 |
> |
#endif |
355 |
> |
for (q = 0; q < 3; q++) |
356 |
> |
vd[q] = (wp[q] - odev.v.vp[q])/ip[2]; |
357 |
> |
d2 = fdir2diff(qtL.wd[li], vd); |
358 |
> |
#ifdef MAXDIFF2 |
359 |
> |
if (d2 > MAXDIFF2) |
360 |
> |
return(0); /* leaf dir. too far off */ |
361 |
> |
#endif |
362 |
|
x = ip[0] * odev.hres; |
363 |
|
y = ip[1] * odev.vres; |
364 |
|
z = ip[2]; |
381 |
|
tp->flgs |= CHLFF(q); |
382 |
|
break; |
383 |
|
} |
384 |
< |
/* check existing leaf */ |
272 |
< |
if (lo != tp->k[q].li) { |
384 |
> |
if (lo != tp->k[q].li) { /* check old leaf */ |
385 |
|
lo = tp->k[q].li; |
386 |
|
VCOPY(wp, qtL.wp[lo]); |
387 |
|
viewloc(ip, &odev.v, wp); |
388 |
|
} |
389 |
|
/* is node minimum size? */ |
390 |
< |
if (x1-x0 <= qtMinNodesiz || y1-y0 <= qtMinNodesiz) { |
391 |
< |
if (z > (1.-qtDepthEps)*ip[2]) /* who is closer? */ |
392 |
< |
return; /* old one is */ |
393 |
< |
tp->k[q].li = li; /* new one is */ |
390 |
> |
if (y1-y0 <= qtMinNodesiz || x1-x0 <= qtMinNodesiz) { |
391 |
> |
if (z > (1.+qtDepthEps)*ip[2]) |
392 |
> |
return(0); /* old one closer */ |
393 |
> |
if (z >= (1.-qtDepthEps)*ip[2] && |
394 |
> |
fdir2diff(qtL.wd[lo], vd) < d2) |
395 |
> |
return(0); /* old one better */ |
396 |
> |
tp->k[q].li = li; /* else new one is */ |
397 |
|
tp->flgs |= CHF(q); |
398 |
|
break; |
399 |
|
} |
405 |
|
my = ip[1] * odev.vres; |
406 |
|
if (mx >= (x0 + x1) >> 1) q |= 01; |
407 |
|
if (my >= (y0 + y1) >> 1) q |= 02; |
408 |
+ |
tp->flgs = CH_ANY|LFF(q); /* all new */ |
409 |
|
tp->k[q].li = lo; |
294 |
– |
tp->flgs |= LFF(q)|CH_ANY; /* all new */ |
410 |
|
} |
411 |
+ |
return(1); /* done */ |
412 |
|
} |
413 |
|
|
414 |
|
|
415 |
< |
dev_value(c, p) /* add a pixel value to our output queue */ |
415 |
> |
dev_value(c, p, v) /* add a pixel value to our quadtree */ |
416 |
|
COLR c; |
417 |
< |
FVECT p; |
417 |
> |
FVECT p, v; |
418 |
|
{ |
419 |
|
register int li; |
420 |
|
|
421 |
|
li = newleaf(); |
422 |
|
VCOPY(qtL.wp[li], p); |
423 |
+ |
qtL.wd[li] = encodedir(v); |
424 |
|
tmCvColrs(&qtL.brt[li], qtL.chr[li], c, 1); |
425 |
< |
addleaf(li); |
425 |
> |
if (!addleaf(li)) |
426 |
> |
ungetleaf(li); |
427 |
|
} |
428 |
|
|
429 |
|
|
479 |
|
qtL.chr+borg, blen); |
480 |
|
qtL.tml = qtL.tl; |
481 |
|
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); |
482 |
|
} |