Cache-oblivious data structures for orthogonal range searching
From MaRDI portal
Publication:5361629
DOI10.1145/777792.777828zbMath1374.68625OpenAlexW2171038510MaRDI QIDQ5361629
Bryan Holland-Minkley, Andrew Danner, Lars Arge, Pankaj K. Agarwal
Publication date: 29 September 2017
Published in: Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/777792.777828
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (7)
The cost of cache-oblivious searching ⋮ Space efficient dynamic orthogonal range reporting ⋮ On Cartesian trees and range minimum queries ⋮ Cache-oblivious range reporting with optimal queries requires superlinear space ⋮ A general approach for cache-oblivious range reporting and approximate range counting ⋮ Cache-oblivious R-trees ⋮ Unnamed Item
This page was built for publication: Cache-oblivious data structures for orthogonal range searching
