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

Lars Arge et al. (2004)
a service of Schloss Dagstuhl - Leibniz Center for Informatics