On R-Trees with Low Stabbing Number (original) (raw)

Lecture Notes in Computer Science, 2000

Abstract

. The R-tree is a well-known bounding-volume hierarchy thatis suitable for storing geometric data on secondary memory. Unfortunately,no good analysis of its query time exists. We describe a new algorithmto construct an R-tree for a set of planar objects that has provablygood query complexity for point location queries and range queries withranges of small width. For certain important special cases,

Mikael Hammar hasn't uploaded this paper.

Let Mikael know you want this paper to be uploaded.

Ask for this paper to be uploaded.