Box-trees and R-trees with near-optimal query time
From MaRDI portal
Publication:5361567
DOI10.1145/378583.378645zbMath1374.68127OpenAlexW2039336640MaRDI QIDQ5361567
Mikael Hammar, Joachim Gudmundsson, Pankaj K. Agarwal, Herman J. Haverkort, Mark T. de Berg
Publication date: 29 September 2017
Published in: Proceedings of the seventeenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/2487
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (1)
This page was built for publication: Box-trees and R-trees with near-optimal query time