Towards Tight Lower Bounds for Range Reporting on the RAM
Allan Gr{\o}nlund, Kasper Green Larsen

TL;DR
This paper advances understanding of the computational complexity of orthogonal range reporting on the RAM by establishing tight cell probe lower bounds for the ball-inheritance problem, which underpins current upper bound solutions.
Contribution
It proves tight cell probe lower bounds for the ball-inheritance problem, significantly narrowing the gap between known upper and lower bounds for range reporting.
Findings
Lower bounds match existing upper bounds for many parameters.
Excludes further improvements in range reporting via ball-inheritance reduction.
Progress towards resolving the complexity of range reporting in the word-RAM model.
Abstract
In the orthogonal range reporting problem, we are to preprocess a set of points with integer coordinates on a grid. The goal is to support reporting all points inside an axis-aligned query rectangle. This is one of the most fundamental data structure problems in databases and computational geometry. Despite the importance of the problem its complexity remains unresolved in the word-RAM. On the upper bound side, three best tradeoffs exists: (1.) Query time with words of space for any constant . (2.) Query time with words of space. (3.) Query time with optimal words of space. However, the only known query time lower bound is , even for linear space data structures. All three current best upper bound tradeoffs…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Robotics and Sensor-Based Localization · Advanced Image and Video Retrieval Techniques
