Improved pointer machine and I/O lower bounds for simplex range reporting and related problems

DOI10.1145/2261250.2261301zbMath1293.68277OpenAlexW1984079283MaRDI QIDQ2874595

Peyman Afshani

Publication date: 7 August 2014

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

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

zbMATH Keywords

lower boundsexternal memory algorithmssimplex range reporting

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items

On semialgebraic range reporting ⋮ Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions ⋮ Permuting and Batched Geometric Lower Bounds in the I/O Model