Box-trees and R-trees with near-optimal query time

DOI10.1007/s00454-002-2817-1zbMath1016.68058OpenAlexW2134438395MaRDI QIDQ1849440

Mark T. de Berg, Herman J. Haverkort, Joachim Gudmundsson, Pankaj K. Agarwal, Mikael Hammar

Publication date: 1 December 2002

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-2817-1

zbMATH Keywords

box-tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Approximate range searching in external memory, Approximate Range Searching in External Memory, Approximate range searching using binary space partitions, Efficient \(c\)-oriented range searching with DOP-trees, Cache-oblivious R-trees