Abstract
The R-tree is a well-known bounding-volume hierarchy that
is suitable for storing geometric data on secondary memory. Unfortu-
nately, no good analysis of its query time exists. We describe a new algo-
rithm to construct an R-tree for a set of planar objects that has provably
good query complexity for point location queries and
... read more