New data structures for orthogonal range searching (2000)

by Stephen Alstrup , Theis Rauhe , Gerth Stølting Brodal
Venue:In Proc. 41st IEEE Symposium on Foundations of Computer Science
Citations:67 - 2 self

Active Bibliography

70 Range Searching – Pankaj K. Agarwal - 1996
65 Lower bounds for orthogonal range searching: I. the reporting case – Bernard Chazelle - 1990
Spring ’12 Scribe Notes Collection – Prof Erik Demaine, Ta Tom Morgan, Justin Zhang, Editing Justin, Zhang Contents
1 Non-orthogonal Range Searching – Yurai Núñez - 2007
26 Optimal Dynamic Range Searching in Non-replicating Index Structures – K. V. Ravi Kanth, Ambuj K. Singh - 1997
81 External Memory Data Structures – Lars Arge - 2001
17 Optimal static range reporting in one dimension – Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe - 2001
Low-Entropy Computational Geometry – Wolfgang Johann Heinrich Mulzer - 2010
9 Range Searching in Categorical Data: Colored Range Searching on Grid – Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan - 2002
65 Closest-Point Problems in Computational Geometry – Michiel Smid - 1997
Non-orthogonal Range Searching: A Review – Yurai Núñez-rodríguez - 2008
2 External Memory Geometric Data Structures, Handbook of Massive Data Sets – Lars Arge - 2002
8 Fast algorithms for 3-d dominance reporting and counting – Qingmin Shi, Joseph Jaja - 2003
1 Novel transformation techniques using q-heaps with applications to computational geometry – Qingmin Shi, Joseph Jaja
39 Faster Deterministic Sorting and Searching in Linear Space – Arne Andersson - 1995
15 Multi-Method Dispatching: A Geometric Approach with Applications to String Matching Problems – Paolo Ferragina, S. Muthukrishnan, Mark De Berg - 1999
15 Orthogonal Range Searching on the RAM, Revisited – Timothy M. Chan, Kasper Green, Larsen Mihai Pǎtras¸cu - 2011
21 Two- and Three-Dimensional Point Location in Rectangular Subdivisions – Mark De Berg, Marc Van Kreveld, Jack Snoeyink - 1995
Adaptive and Approximate Orthogonal Range Counting ∗ – unknown authors