The Space Complexity of 2-Dimensional Approximate Range Counting

DOI10.1137/1.9781611973105.19zbMath1422.68056arXiv1207.4382OpenAlexW2949231659MaRDI QIDQ5741727

Ke Yi, Zhewei Wei

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.4382

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)

This page was built for publication: The Space Complexity of 2-Dimensional Approximate Range Counting