Cache-oblivious R-trees

DOI10.1145/1064092.1064120zbMath1380.68138OpenAlexW2006706309MaRDI QIDQ5370610

Lars Arge, Mark T. de Berg, Herman J. Haverkort

Publication date: 20 October 2017

Published in: Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1064092.1064120

zbMATH Keywords

geometric data structuresR-treescache-oblivious data structuresI/O-efficiency

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (2)

Cache-oblivious range reporting with optimal queries requires superlinear space ⋮ A general approach for cache-oblivious range reporting and approximate range counting

This page was built for publication: Cache-oblivious R-trees