10 |
|
|
11 |
|
#include "standard.h" |
12 |
|
#include "rhd_qtree.h" |
13 |
+ |
/* quantity of leaves to free at a time */ |
14 |
+ |
#ifndef LFREEPCT |
15 |
+ |
#define LFREEPCT 25 |
16 |
+ |
#endif |
17 |
|
|
18 |
|
RTREE qtrunk; /* our quadtree trunk */ |
19 |
|
double qtDepthEps = .02; /* epsilon to compare depths (z fraction) */ |
62 |
|
{ |
63 |
|
register int i; |
64 |
|
|
65 |
< |
qtrunk.flgs = 0; |
65 |
> |
qtrunk.flgs = CH_ANY; |
66 |
|
nexttwig = 0; |
67 |
|
if (twigbundle == NULL) |
68 |
|
return; |
327 |
|
int redo; |
328 |
|
{ |
329 |
|
int aorg, alen, borg, blen; |
330 |
+ |
/* recompute mapping? */ |
331 |
+ |
if (redo) |
332 |
+ |
qtL.tml = qtL.bl; |
333 |
|
/* already done? */ |
334 |
|
if (qtL.tml == qtL.tl) |
335 |
|
return(1); |
329 |
– |
if (redo) |
330 |
– |
qtL.tml = qtL.bl; |
336 |
|
/* compute segments */ |
337 |
|
aorg = qtL.tml; |
338 |
|
if (qtL.tl >= aorg) { |