Article

New data structures for orthogonal range searching

Authors:

S. Alstrup,

G. Stolting Brodal,

T. RauheAuthors Info & Claims

FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Page 198

Published: 12 November 2000 Publication History

Publisher Site

Abstract

We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general range reporting problem in R/sup 3/, we achieve query time O(log n+k) using space O(n log/sup 1+/spl epsiv// n), where n denotes the number of stored points and k the number of points to be reported. For the range reporting problem on an n/spl times/n grid, we achieve query time O(log log n+k) using space O(n log/sup /spl epsiv// n). For the two-dimensional semi-group range sum problem we achieve query time O(log n) using space O(n log n).

Cited By

View all

Nekrich YMarx D(2021)New data structures for orthogonal range reporting and range minima queriesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458137(1191-1205)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458137
Christiansen AEttienne MKociumaka TNavarro GPrezza N(2020)Optimal-Time Dictionary-Compressed IndexesACM Transactions on Algorithms10.1145/342647317:1(1-39)Online publication date: 31-Dec-2020
https://dl.acm.org/doi/10.1145/3426473
Yang WWang KRuan NGao WJia WZhao WLiu NZhang Y(2019)Time-Sync Video Tag Extraction Using Semantic Association GraphACM Transactions on Knowledge Discovery from Data10.1145/333293213:4(1-24)Online publication date: 2-Jul-2019
https://dl.acm.org/doi/10.1145/3332932
Show More Cited By

Index Terms

Index terms have been assigned to the content through auto-classification.

Recommendations

Orthogonal range searching on the RAM, revisited
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometry

We present a number of new results on one of the most extensively studied topics in computational geometry, orthogonal range searching. All our results are in the standard word RAM model: We present two data structures for 2-d orthogonal range ...
Cache-oblivious planar orthogonal range searching and counting
SCG '05: Proceedings of the twenty-first annual symposium on Computational geometry

We present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for cache-oblivious planar orthogonal range searching.Our range counting structure uses O(N log₂ N) space and answers queries using ...
Space Efficient Dynamic Orthogonal Range Reporting

In this paper we present new space efficient dynamic data structures for orthogonal range reporting. The described data structures support planar range reporting queries in time O(log n+klog log (4n/(k+1))) and space O(nlog log n), or in time O(log n+k) ...

Comments

Information & Contributors

Information

Published In

FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science

November 2000

ISBN:0769508502

Publisher

IEEE Computer Society

United States

Publication History

Published: 12 November 2000

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

54
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nekrich YMarx D(2021)New data structures for orthogonal range reporting and range minima queriesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458137(1191-1205)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458137
Christiansen AEttienne MKociumaka TNavarro GPrezza N(2020)Optimal-Time Dictionary-Compressed IndexesACM Transactions on Algorithms10.1145/342647317:1(1-39)Online publication date: 31-Dec-2020
https://dl.acm.org/doi/10.1145/3426473
Yang WWang KRuan NGao WJia WZhao WLiu NZhang Y(2019)Time-Sync Video Tag Extraction Using Semantic Association GraphACM Transactions on Knowledge Discovery from Data10.1145/333293213:4(1-24)Online publication date: 2-Jul-2019
https://dl.acm.org/doi/10.1145/3332932
Roy ISrivastava AGrimm MAluru S(2016)Parallel interval stabbing on the automata processorProceedings of the Sixth Workshop on Irregular Applications: Architectures and Algorithms10.5555/3018843.3018846(10-17)Online publication date: 13-Nov-2016
https://dl.acm.org/doi/10.5555/3018843.3018846
He MMunro JZhou G(2016)Data Structures for Path QueriesACM Transactions on Algorithms10.1145/290536812:4(1-32)Online publication date: 16-Aug-2016
https://dl.acm.org/doi/10.1145/2905368
Chan TWilkinson B(2016)Adaptive and Approximate Orthogonal Range CountingACM Transactions on Algorithms10.1145/283056712:4(1-15)Online publication date: 2-Sep-2016
https://dl.acm.org/doi/10.1145/2830567
Rahul SIndyk P(2015)Improved bounds for orthogonal point enclosure query and point location in orthogonal subdivisions in R3Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722144(200-211)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722144
Afshani PChekuri C(2014)Fast computation of output-sensitive maxima in a word RAMProceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms10.5555/2634074.2634178(1414-1423)Online publication date: 5-Jan-2014
https://dl.acm.org/doi/10.5555/2634074.2634178
Nekrich Y(2014)Efficient range searching for categorical and plain dataACM Transactions on Database Systems10.1145/254392439:1(1-21)Online publication date: 6-Jan-2014
https://dl.acm.org/doi/10.1145/2543924
Lewenstein MIan Munro JRaman VThankachan S(2014)Less spaceTheoretical Computer Science10.1016/j.tcs.2014.09.003557:C(120-127)Online publication date: 6-Nov-2014
https://dl.acm.org/doi/10.1016/j.tcs.2014.09.003
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Orthogonal range searching on the RAM, revisited

Cache-oblivious planar orthogonal range searching and counting

Space Efficient Dynamic Orthogonal Range Reporting

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations