The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree.

Lars Arge Mark de Berg Herman J. Haverkort Ke Yi The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. 2004 Cache-Oblivious and Cache-Aware Algorithms http://drops.dagstuhl.de/opus/volltexte/2005/155 conf/dagstuhl/2004P4301 db/conf/dagstuhl/P4301.html#ArgeBHY04