3 ms·
Search for R-Tree and the many variants used for spatial indexing. You will find the papers very pragmatic about the tradeoffs between optimal coverage and spee
by mikhailfranco 17y ago
Search for R-Tree and the many variants used for spatial indexing. You will find the papers very pragmatic about the tradeoffs between optimal coverage and speed of creation, update and traversal. Parallelizing with transactional guarantees is still a bit of a research topic. It would be interesting to do some experimental implementations in, say, Erlang.
- gruseom 17y agoWe'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.