2 ms·
We've actually been deep into R-trees, and I wrote an Rstar-tree recently, but the problem posted above, of coalescing adjacent rectangles that have some sort o
by gruseom 17y ago
We've actually been deep into R-trees, and I wrote an Rstar-tree recently, but the problem posted above, of coalescing adjacent rectangles that have some sort of affinity (e.g. same color), doesn't appear in the R-tree literature I've read so far. Probably you could do it using neighbor queries and remove/reinsert, but this is probably too slow. If you have any further suggestions along these lines, do please post them.