Lower Bounds for Sorted Geometric Queries in the I/O Model

DOI10.1007/978-3-642-33090-2_6zbMath1365.68167OpenAlexW49596405MaRDI QIDQ2912825

Peyman Afshani, Norbert Zeh

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_6

Mathematics Subject Classification ID

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

Related Items (1)

Permuting and Batched Geometric Lower Bounds in the I/O Model

This page was built for publication: Lower Bounds for Sorted Geometric Queries in the I/O Model