-
-
Notifications
You must be signed in to change notification settings - Fork 308
/
node.c
648 lines (552 loc) · 16.1 KB
/
node.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
/****************************************************************************
* MODULE: R-Tree library
*
* AUTHOR(S): Antonin Guttman - original code
* Daniel Green (green@superliminal.com) - major clean-up
* and implementation of bounding spheres
* Markus Metz - file-based and memory-based R*-tree
*
* PURPOSE: Multidimensional index
*
* COPYRIGHT: (C) 2010 by the GRASS Development Team
*
* This program is free software under the GNU General Public
* License (>=v2). Read the file COPYING that comes with GRASS
* for details.
*****************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <grass/gis.h>
#include "index.h"
#include "split.h"
#include "card.h"
/* rectangle distances for forced removal */
struct dist
{
int id; /* branch id */
RectReal distance; /* distance to node center */
};
/* Initialize one branch cell in an internal node. */
static void RTreeInitNodeBranchM(struct RTree_Branch *b, struct RTree *t)
{
RTreeInitRect(&(b->rect), t);
memset(&(b->child), 0, sizeof(union RTree_Child));
b->child.ptr = NULL;
}
/* Initialize one branch cell in an internal node. */
static void RTreeInitNodeBranchF(struct RTree_Branch *b, struct RTree *t)
{
RTreeInitRect(&(b->rect), t);
memset(&(b->child), 0, sizeof(union RTree_Child));
b->child.pos = -1;
}
/* Initialize one branch cell in a leaf node. */
static void RTreeInitLeafBranch(struct RTree_Branch *b, struct RTree *t)
{
RTreeInitRect(&(b->rect), t);
memset(&(b->child), 0, sizeof(union RTree_Child));
b->child.id = 0;
}
static void (*RTreeInitBranch[3]) (struct RTree_Branch *b, struct RTree *t) = {
RTreeInitLeafBranch, RTreeInitNodeBranchM, RTreeInitNodeBranchF
};
/* Initialize a Node structure. */
/* type = 1: leaf, type = 2: internal, memory, type = 3: internal, file */
void RTreeInitNode(struct RTree *t, struct RTree_Node *n, int type)
{
int i;
n->count = 0;
n->level = -1;
for (i = 0; i < MAXCARD; i++)
RTreeInitBranch[type](&(n->branch[i]), t);
}
/* Make a new node and initialize to have all branch cells empty. */
struct RTree_Node *RTreeAllocNode(struct RTree *t, int level)
{
int i;
struct RTree_Node *n;
n = (struct RTree_Node *)malloc(sizeof(struct RTree_Node));
assert(n);
n->count = 0;
n->level = level;
n->branch = malloc(MAXCARD * sizeof(struct RTree_Branch));
for (i = 0; i < MAXCARD; i++) {
n->branch[i].rect.boundary = RTreeAllocBoundary(t);
RTreeInitBranch[NODETYPE(level, t->fd)](&(n->branch[i]), t);
}
return n;
}
void RTreeFreeNode(struct RTree_Node *n)
{
int i;
assert(n);
for (i = 0; i < MAXCARD; i++)
RTreeFreeBoundary(&(n->branch[i].rect));
free(n->branch);
free(n);
}
/* copy node 2 to node 1 */
void RTreeCopyNode(struct RTree_Node *n1, struct RTree_Node *n2, struct RTree *t)
{
int i;
assert(n1 && n2);
n1->count = n2->count;
n1->level = n2->level;
for (i = 0; i < MAXCARD; i++) {
RTreeCopyBranch(&(n1->branch[i]), &(n2->branch[i]), t);
}
}
/* copy branch 2 to branch 1 */
void RTreeCopyBranch(struct RTree_Branch *b1, struct RTree_Branch *b2, struct RTree *t)
{
b1->child = b2->child;
RTreeCopyRect(&(b1->rect), &(b2->rect), t);
}
/*
* Find the smallest rectangle that includes all rectangles in
* branches of a node.
*/
void RTreeNodeCover(struct RTree_Node *n, struct RTree_Rect *r, struct RTree *t)
{
int i, first_time = 1;
if ((n)->level > 0) { /* internal node */
for (i = 0; i < t->nodecard; i++) {
if (t->valid_child(&(n->branch[i].child))) {
if (first_time) {
RTreeCopyRect(r, &(n->branch[i].rect), t);
first_time = 0;
}
else
RTreeExpandRect(r, &(n->branch[i].rect), t);
}
}
}
else { /* leaf */
for (i = 0; i < t->leafcard; i++) {
if (n->branch[i].child.id) {
if (first_time) {
RTreeCopyRect(r, &(n->branch[i].rect), t);
first_time = 0;
}
else
RTreeExpandRect(r, &(n->branch[i].rect), t);
}
}
}
}
/*
* Idea from R*-tree, modified: not overlap size but overlap number
*
* Pick a branch from leaf nodes (current node has level 1). Pick the
* one that will result in the smallest number of overlapping siblings.
* This will result in the least ambiguous node covering the new
* rectangle, improving search speed.
* In case of a tie, pick the one which needs the smallest increase in
* area to accommodate the new rectangle, then the smallest area before,
* to get the best resolution when searching.
*/
static int RTreePickLeafBranch(struct RTree_Rect *r, struct RTree_Node *n, struct RTree *t)
{
struct RTree_Rect *rr;
int i, j;
RectReal increase, bestIncr = -1, area, bestArea = 0;
int best = 0, bestoverlap;
int overlap;
bestoverlap = t->nodecard + 1;
/* get the branch that will overlap with the smallest number of
* sibling branches when including the new rectangle */
for (i = 0; i < t->nodecard; i++) {
if (t->valid_child(&(n->branch[i].child))) {
rr = &n->branch[i].rect;
RTreeCombineRect(r, rr, &(t->orect), t);
area = RTreeRectSphericalVolume(rr, t);
increase = RTreeRectSphericalVolume(&(t->orect), t) - area;
overlap = 0;
for (j = 0; j < t->leafcard; j++) {
if (j != i) {
rr = &n->branch[j].rect;
overlap += RTreeOverlap(&(t->orect), rr, t);
}
}
if (overlap < bestoverlap) {
best = i;
bestoverlap = overlap;
bestArea = area;
bestIncr = increase;
}
else if (overlap == bestoverlap) {
/* resolve ties */
if (increase < bestIncr) {
best = i;
bestArea = area;
bestIncr = increase;
}
else if (increase == bestIncr && area < bestArea) {
best = i;
bestArea = area;
}
}
}
}
return best;
}
/*
* Pick a branch. Pick the one that will need the smallest increase
* in area to accommodate the new rectangle. This will result in the
* least total area for the covering rectangles in the current node.
* In case of a tie, pick the one which was smaller before, to get
* the best resolution when searching.
*/
int RTreePickBranch(struct RTree_Rect *r, struct RTree_Node *n, struct RTree *t)
{
struct RTree_Rect *rr;
int i, first_time = 1;
RectReal increase, bestIncr = (RectReal) -1, area, bestArea = 0;
int best = 0;
assert((n)->level > 0); /* must not be called on leaf node */
if ((n)->level == 1)
return RTreePickLeafBranch(r, n, t);
for (i = 0; i < t->nodecard; i++) {
if (t->valid_child(&(n->branch[i].child))) {
rr = &n->branch[i].rect;
area = RTreeRectSphericalVolume(rr, t);
RTreeCombineRect(r, rr, &(t->orect), t);
increase = RTreeRectSphericalVolume(&(t->orect), t) - area;
if (increase < bestIncr || first_time) {
best = i;
bestArea = area;
bestIncr = increase;
first_time = 0;
}
else if (increase == bestIncr && area < bestArea) {
best = i;
bestArea = area;
}
}
}
return best;
}
/* Disconnect a dependent node. */
void RTreeDisconnectBranch(struct RTree_Node *n, int i, struct RTree *t)
{
if ((n)->level > 0) {
assert(n && i >= 0 && i < t->nodecard);
assert(t->valid_child(&(n->branch[i].child)));
if (t->fd < 0)
RTreeInitNodeBranchM(&(n->branch[i]), t);
else
RTreeInitNodeBranchF(&(n->branch[i]), t);
}
else {
assert(n && i >= 0 && i < t->leafcard);
assert(n->branch[i].child.id);
RTreeInitLeafBranch(&(n->branch[i]), t);
}
n->count--;
}
/* Destroy (free) node recursively. */
/* NOTE: only needed for memory based index */
void RTreeDestroyNode(struct RTree_Node *n, int nodes)
{
int i;
if (n->level > 0) { /* it is not leaf -> destroy childs */
for (i = 0; i < nodes; i++) {
if (n->branch[i].child.ptr) {
RTreeDestroyNode(n->branch[i].child.ptr, nodes);
}
}
}
/* Free this node */
RTreeFreeNode(n);
return;
}
/****************************************************************
* *
* R*-tree: force remove FORCECARD branches for reinsertion *
* *
****************************************************************/
/*
* swap dist structs
*/
static void RTreeSwapDist(struct dist *a, struct dist *b)
{
struct dist c;
c = *a;
*a = *b;
*b = c;
}
/*
* check if dist is sorted ascending to distance
*/
static int RTreeDistIsSorted(struct dist *d, int first, int last)
{
int i;
for (i = first; i < last; i++) {
if (d[i].distance > d[i + 1].distance)
return 0;
}
return 1;
}
/*
* partition dist for quicksort on distance
*/
static int RTreePartitionDist(struct dist *d, int first, int last)
{
int pivot, mid = ((first + last) >> 1);
int larger, smaller;
if (last - first == 1) { /* only two items in list */
if (d[first].distance > d[last].distance) {
RTreeSwapDist(&(d[first]), &(d[last]));
}
return last;
}
/* Larger of two */
larger = pivot = mid;
smaller = first;
if (d[first].distance > d[mid].distance) {
larger = pivot = first;
smaller = mid;
}
if (d[larger].distance > d[last].distance) {
/* larger is largest, get the larger of smaller and last */
pivot = last;
if (d[smaller].distance > d[last].distance) {
pivot = smaller;
}
}
if (pivot != last) {
RTreeSwapDist(&(d[pivot]), &(d[last]));
}
pivot = first;
while (first < last) {
if (d[first].distance <= d[last].distance) {
if (pivot != first) {
RTreeSwapDist(&(d[pivot]), &(d[first]));
}
pivot++;
}
++first;
}
if (pivot != last) {
RTreeSwapDist(&(d[pivot]), &(d[last]));
}
return pivot;
}
/*
* quicksort dist struct ascending by distance
* n is last valid index
*/
static void RTreeQuicksortDist(struct dist *d, int n)
{
int pivot, first, last;
int s_first[MAXCARD + 1], s_last[MAXCARD + 1], stacksize;
s_first[0] = 0;
s_last[0] = n;
stacksize = 1;
/* use stack */
while (stacksize) {
stacksize--;
first = s_first[stacksize];
last = s_last[stacksize];
if (first < last) {
if (!RTreeDistIsSorted(d, first, last)) {
pivot = RTreePartitionDist(d, first, last);
s_first[stacksize] = first;
s_last[stacksize] = pivot - 1;
stacksize++;
s_first[stacksize] = pivot + 1;
s_last[stacksize] = last;
stacksize++;
}
}
}
}
/*
* Allocate space for a branch in the list used in InsertRect to
* store branches of nodes that are too full.
*/
static struct RTree_ListBranch *RTreeNewListBranch(struct RTree *t)
{
struct RTree_ListBranch *p =
(struct RTree_ListBranch *)malloc(sizeof(struct RTree_ListBranch));
assert(p);
p->b.rect.boundary = RTreeAllocBoundary(t);
return p;
}
/*
* Add a branch to the reinsertion list. It will later
* be reinserted into the index structure.
*/
static void RTreeReInsertBranch(struct RTree_Branch b, int level,
struct RTree_ListBranch **ee, struct RTree *t)
{
register struct RTree_ListBranch *l;
l = RTreeNewListBranch(t);
RTreeCopyBranch(&(l->b), &b, t);
l->level = level;
l->next = *ee;
*ee = l;
}
/*
* Remove branches from a node. Select the 2 branches whose rectangle
* center is farthest away from node cover center.
* Old node updated.
*/
static void RTreeRemoveBranches(struct RTree_Node *n, struct RTree_Branch *b,
struct RTree_ListBranch **ee, struct RTree_Rect *cover,
struct RTree *t)
{
int i, j, maxkids, type;
RectReal center_r, delta;
struct dist rdist[MAXCARD + 1];
struct RTree_Rect *new_cover = &(t->orect);
RectReal *center_n = t->center_n;
assert(cover);
maxkids = MAXKIDS((n)->level, t);
type = NODETYPE((n)->level, t->fd);
assert(n->count == maxkids); /* must be full */
RTreeCombineRect(cover, &(b->rect), new_cover, t);
/* center coords of node cover */
for (j = 0; j < t->ndims; j++) {
center_n[j] = (new_cover->boundary[j + t->ndims_alloc] + new_cover->boundary[j]) / 2;
}
/* compute distances of child rectangle centers to node cover center */
for (i = 0; i < maxkids; i++) {
RTreeCopyBranch(&(t->BranchBuf[i]), &(n->branch[i]), t);
rdist[i].distance = 0;
rdist[i].id = i;
for (j = 0; j < t->ndims; j++) {
center_r =
(t->BranchBuf[i].rect.boundary[j + t->ndims_alloc] +
t->BranchBuf[i].rect.boundary[j]) / 2;
delta = center_n[j] - center_r;
rdist[i].distance += delta * delta;
}
RTreeInitBranch[type](&(n->branch[i]), t);
}
/* new branch */
RTreeCopyBranch(&(t->BranchBuf[maxkids]), b, t);
rdist[maxkids].distance = 0;
for (j = 0; j < t->ndims; j++) {
center_r =
(b->rect.boundary[j + t->ndims_alloc] +
b->rect.boundary[j]) / 2;
delta = center_n[j] - center_r;
rdist[maxkids].distance += delta * delta;
}
rdist[maxkids].id = maxkids;
/* quicksort dist */
RTreeQuicksortDist(rdist, maxkids);
/* put largest three in branch list, farthest from center first */
for (i = 0; i < FORCECARD; i++) {
RTreeReInsertBranch(t->BranchBuf[rdist[maxkids - i].id], n->level, ee, t);
}
/* put remaining in node, closest to center first */
for (i = 0; i < maxkids - FORCECARD + 1; i++) {
RTreeCopyBranch(&(n->branch[i]), &(t->BranchBuf[rdist[i].id]), t);
}
n->count = maxkids - FORCECARD + 1;
}
/*
* Add a branch to a node. Split the node if necessary.
* Returns 0 if node not split. Old node updated.
* Returns 1 if node split, sets *new_node to address of new node.
* Old node updated, becomes one of two.
* Returns 2 if branches were removed for forced reinsertion
*/
int RTreeAddBranch(struct RTree_Branch *b, struct RTree_Node *n,
struct RTree_Node **newnode, struct RTree_ListBranch **ee,
struct RTree_Rect *cover, char *overflow, struct RTree *t)
{
int i, maxkids;
maxkids = MAXKIDS((n)->level, t);
if (n->count < maxkids) { /* split won't be necessary */
if ((n)->level > 0) { /* internal node */
for (i = 0; i < maxkids; i++) { /* find empty branch */
if (!t->valid_child(&(n->branch[i].child))) {
/* copy branch */
n->branch[i].child = b->child;
RTreeCopyRect(&(n->branch[i].rect), &(b->rect), t);
n->count++;
break;
}
}
return 0;
}
else if ((n)->level == 0) { /* leaf */
for (i = 0; i < maxkids; i++) { /* find empty branch */
if (n->branch[i].child.id == 0) {
/* copy branch */
n->branch[i].child = b->child;
RTreeCopyRect(&(n->branch[i].rect), &(b->rect), t);
n->count++;
break;
}
}
return 0;
}
}
else {
if (n->level < t->rootlevel && overflow[n->level]) {
/* R*-tree forced reinsert */
RTreeRemoveBranches(n, b, ee, cover, t);
overflow[n->level] = 0;
return 2;
}
else {
if (t->fd > -1)
RTreeInitNode(t, *newnode, NODETYPE(n->level, t->fd));
else
*newnode = RTreeAllocNode(t, (n)->level);
RTreeSplitNode(n, b, *newnode, t);
return 1;
}
}
/* should not be reached */
assert(0);
return -1;
}
/*
* for debugging only: print items to stdout
*/
void RTreeTabIn(int depth)
{
int i;
for (i = 0; i < depth; i++)
putchar('\t');
}
static void RTreePrintBranch(struct RTree_Branch *b, int depth, struct RTree *t)
{
RTreePrintRect(&(b->rect), depth, t);
RTreePrintNode(b->child.ptr, depth, t);
}
/* Print out the data in a node. */
void RTreePrintNode(struct RTree_Node *n, int depth, struct RTree *t)
{
int i, maxkids;
RTreeTabIn(depth);
maxkids = (n->level > 0 ? t->nodecard : t->leafcard);
fprintf(stdout, "node");
if (n->level == 0)
fprintf(stdout, " LEAF");
else if (n->level > 0)
fprintf(stdout, " NONLEAF");
else
fprintf(stdout, " TYPE=?");
fprintf(stdout, " level=%d count=%d", n->level, n->count);
for (i = 0; i < maxkids; i++) {
if (n->level == 0) {
RTreeTabIn(depth);
RTreePrintRect(&(n->branch[i].rect), depth, t);
fprintf(stdout, "\t%d: data id = %d\n", i,
n->branch[i].child.id);
}
else {
RTreeTabIn(depth);
fprintf(stdout, "branch %d\n", i);
RTreePrintBranch(&(n->branch[i]), depth + 1, t);
}
}
}