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