Bryan T. Wilkinson

Adaptive and Approximate Orthogonal Range Counting

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Close Abstract

We present three new results on one of the most basic problems in geometric data structures, 2-D orthogonal range counting. All the results are in the w-bit word RAM model.
•It is well known that there are linear-space data structures for 2-D orthogonal range counting with worst-case optimal query time O(log_w n). We give an O(n loglog n)-space adaptive data structure that improves the query time to O(loglog n + log_w k), where k is the output count. When k=O(1), our bounds match the state of the art for the 2-D orthogonal range emptiness problem [Chan, Larsen, and Pătraşcu, SoCG 2011].
•We give an O(n loglog n)-space data structure for approximate 2-D orthogonal range counting that can compute a (1+δ)-factor approximation to the count in O(loglog n) time for any fixed constant δ>0. Again, our bounds match the state of the art for the 2-D orthogonal range emptiness problem.
•Lastly, we consider the 1-D range selection problem, where a query in an array involves finding the kth least element in a given subarray. This problem is closely related to 2-D 3-sided orthogonal range counting. Recently, Jørgensen and Larsen [SODA 2011] presented a linear-space adaptive data structure with query time O(loglog n + log_w k). We give a new linear-space structure that improves the query time to O(1 + log_w k), exactly matching the lower bound proved by Jørgensen and Larsen.
Original languageEnglish
Title of host publicationProceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013
EditorsSanjeev Khanna
Number of pages11
PublisherSociety for Industrial and Applied Mathematics
Publication year2013
ISBN (print)978-1-61197-251-1
ISBN (Electronic)978-1-61197-310-5
Publication statusPublished - 2013
EventACM-SIAM symposium on Disrete Algorithms - New Orleans, United States
Duration: 6 Jan 20138 Jan 2013
Conference number: 24


ConferenceACM-SIAM symposium on Disrete Algorithms
LandUnited States
ByNew Orleans

Bibliographical note

To appear in: SODA’13: 24th Symposium on Discrete Algorithms

See relations at Aarhus University Citationformats

ID: 69901553