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 ungetleaf(li) (qtL.tl=(li)) /* dangerous if used improperly */ |
38 |
|
|
39 |
+ |
|
40 |
|
static RTREE * |
41 |
|
newtwig() /* allocate a twig */ |
42 |
|
{ |
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; |
247 |
|
register RTREE *tp = &qtrunk; |
248 |
|
int x0=0, y0=0, x1=odev.hres, y1=odev.vres; |
249 |
|
int lo = -1; |
250 |
+ |
double d2; |
251 |
|
int x, y, mx, my; |
252 |
|
double z; |
253 |
< |
FVECT ip, wp; |
253 |
> |
FVECT ip, wp, vd; |
254 |
|
register int q; |
255 |
< |
/* compute leaf location */ |
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 |
> |
return(-1); /* 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 addleaf"); |
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 |
> |
return(0); /* leaf dir. too far off */ |
271 |
> |
#endif |
272 |
|
x = ip[0] * odev.hres; |
273 |
|
y = ip[1] * odev.vres; |
274 |
|
z = ip[2]; |
291 |
|
tp->flgs |= CHLFF(q); |
292 |
|
break; |
293 |
|
} |
294 |
< |
/* check existing leaf */ |
270 |
< |
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 |
> |
return(0); /* old one closer */ |
303 |
> |
if (z >= (1.-qtDepthEps)*ip[2] && |
304 |
> |
fdir2diff(qtL.wd[lo], vd) < d2) |
305 |
> |
return(0); /* old one better */ |
306 |
> |
tp->k[q].li = li; /* else new one is */ |
307 |
|
tp->flgs |= CHF(q); |
308 |
|
break; |
309 |
|
} |
315 |
|
my = ip[1] * odev.vres; |
316 |
|
if (mx >= (x0 + x1) >> 1) q |= 01; |
317 |
|
if (my >= (y0 + y1) >> 1) q |= 02; |
318 |
+ |
tp->flgs = CH_ANY|LFF(q); /* all new */ |
319 |
|
tp->k[q].li = lo; |
292 |
– |
tp->flgs |= LFF(q)|CH_ANY; /* all new */ |
320 |
|
} |
321 |
+ |
return(1); /* done */ |
322 |
|
} |
323 |
|
|
324 |
|
|
325 |
< |
dev_value(c, p) /* add a pixel value to our quadtree */ |
325 |
> |
dev_value(c, p, v) /* add a pixel value to our quadtree */ |
326 |
|
COLR c; |
327 |
< |
FVECT p; |
327 |
> |
FVECT p, v; |
328 |
|
{ |
329 |
|
register int li; |
330 |
|
|
331 |
|
li = newleaf(); |
332 |
|
VCOPY(qtL.wp[li], p); |
333 |
+ |
qtL.wd[li] = encodedir(v); |
334 |
|
tmCvColrs(&qtL.brt[li], qtL.chr[li], c, 1); |
335 |
< |
addleaf(li); |
335 |
> |
if (!addleaf(li)) |
336 |
> |
ungetleaf(li); |
337 |
|
} |
338 |
|
|
339 |
|
|