The R-tree is a well-known bounding-volume hierarchy that is suitable for storing geometric data on secondary memory. Unfortunately, no good analysis of its query time exists. We describe a new algorithm to construct an R-tree for a set of planar objects that has provably good query complexity for point location queries and range queries with ranges of small width. For certain important special cases, our bounds are optimal. We also show how to update the structure dynamically, and we generalize our results to higher-dimensional spaces.
CITATION STYLE
De Berg, M., Gudmundsson, J., Hammar, M., & Overmars, M. (2000). On R-trees with low stabbing number. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1879, 167–178. https://doi.org/10.1007/3-540-45253-2_16
Mendeley helps you to discover research relevant for your work.