Orthogonal range searching on the RAM, revisited

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 1-10

  Chan, Timothy M ^a   Larsen, Kasper Green ^b   Pǎtraşcu, Mihai ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b AARHUS UNIVERSITY   (Denmark)

^c AT and T Labs   (Denmark)

Author keywords

Dominance; Geometric data structures; Maxima; Orthogonal range searching; Word RAM

Indexed keywords

DOMINANCE; GEOMETRIC DATA STRUCTURES; MAXIMA; ORTHOGONAL RANGE SEARCHING; WORD RAM;

ALGORITHMS; DATA STRUCTURES;

COMPUTATIONAL GEOMETRY;

EID: 79960154322     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998198     Document Type: Conference Paper

References (58)

1. P. Afshani. On dominance reporting in 3D. In Proc. 16th European Symposium on Algorithms, pages 41-51, 2008.
2. P. Afshani, L. Arge, and K. D. Larsen. Orthogonal range reporting in three and higher dimensions. In Proc. 50th IEEE Symposium on Foundations of Computer Science, pages 149-158, 2009.
3. P. Afshani, L. Arge, and K. D. Larsen. Orthogonal range reporting: Query lower bounds, optimal structures in 3d, and higher dimensional improvements. In Proc. 26th ACM Symposium on Computational Geometry, pages 240-246, 2010.
4. P. Afshani, J. Barbay, and T. M. Chan. Instance-optimal geometric algorithms. In Proc. 50th IEEE Symposium on Foundations of Computer Science, pages 129-138, 2009.
5. P. K. Agarwal. Range searching. In J. E. Goodman and J. O'Rourke, editors, CRC Handbook of Discrete and Computational Geometry. CRC Press, Inc., 2004.
6. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry. AMS Press, 1999.
7. M. Ajtai, M. L. Fredman, and J. Komlós. Hash functions for priority queues. Information and Control, 63(3):217-225, 1984. See also FOCS'83
8. S. Alstrup, G. S. Brodal, and T. Rauhe. New data structures for orthogonal range searching. In Proc. 41st IEEE Symposium on Foundations of Computer Science, pages 198-207, 2000. (Pubitemid 32075891)
9. L. Arge, V. Samoladas, and J. S. Vitter. On two-dimensional indexability and optimal range search indexing. In Proc. 18th ACM Symposium on Principles of Database Systems, pages 346-357, New York, NY, USA, 1999. ACM.
10. J. L. Bentley. Multidimensional divide-and-conquer. Communications of the ACM, 23(4):214-229, 1980.
11. J. L. Bentley, K. L. Clarkson, and D. B. Levine. Fast linear expected-time algorithms for computing maxima and convex hulls. In Proc. 1st ACM/SIAM Symposium on Discrete Algorithms, pages 179-187, 1990.
12. J. L. Bentley and D. Wood. An optimal worst case algorithm for reporting intersections of rectangles. IEEE Transactions on Computers, C-29:571-577, 1980. (Pubitemid 11444886)
13. T. M. Chan. Persistent predecessor search and orthogonal point location in the word RAM. In Proc. 22nd ACM/SIAM Symposium on Discrete Algorithms, pages 1131-1145, 2011.
14. T. M. Chan and M. Pǎtraşcu. Transdichotomous results in computational geometry, I: point location in sublogarithmic time. SIAM Journal on Computing, 39:703-729, 2009.
15. T. M. Chan and M. Pǎtraşcu. Counting inversions, offline orthogonal range counting, and related problems. In Proc. 21st ACM/SIAM Symposium on Discrete Algorithms, pages 161-173, 2010.
16. T. M. Chan and M. Pǎtraşcu. Transdichotomous results in computational geometry, II: offline search. ACM Transactions on Algorithms, submitted, 2010. Preliminary version in STOC'07.
17. B. Chazelle. Filtering search: a new approach to query answering. SIAM Journal on Computing, 15(3):703-724, 1986. (Pubitemid 16634090)
18. B. Chazelle. Functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17(3):427-462, 1988.
19. B. Chazelle. Lower bounds for orthogonal range searching: I. the reporting case. Journal of the ACM, 37(2):200-212, 1990. (Pubitemid 20696132)
20. B. Chazelle. Lower bounds for orthogonal range searching: part II. the arithmetic model. Journal o the ACM, 37(3):439-463, 1990. (Pubitemid 20723064)
21. B. Chazelle. Lower bounds for off-line range searching. In Proc. 27th ACM Symposium on Theory of Computing, pages 733-740, 1995.
22. B. Chazelle and L. J. Guibas. Fractional cascading: I. A data structuring technique. Algorithmica, 1:133-162, 1986. (Pubitemid 17556682)
23. B. Chazelle and L. J. Guibas. Fractional cascading: II. Applications. Algorithmica, 1:163-191, 1986.
24. K. L. Clarkson. New applications of random sling in computational geometry. Discrete and Computational Geometry, 2:195-222, 1987.
25. K. L. Clarkson. More output-sensitive geometric algorithms. In Proc. 35th IEEE Symposium on Foundations of Computer Science, pages 695-702, 1994.
26. K. L. Clarkson and P. W. Shor. Applications of random sling in computational geometry, II. Discrete and Computational Geometry, 4:387-421, 1989.
27. J. Fischer. Optimal succinctness for range minimum queries. In Proc. 9th Latin American Theoretical Informatics Symposium, pages 158-169, 2010.
28. F. W. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 48(3):424-436, 1993.
29. M. L. Fredman. A lower bound on the complexity of orthogonal range queries. Journal of the ACM, 28(4):696-705, 1981.
30. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47(3):424-436, 1993.
31. See also STOC'90.
32. H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In Proc. 16th ACM Symposium on Theory of Computing, pages 135-143, 1984.
33. M. J. Golin. A provably fast linear-expected-time maxima-finding algorithm. Algorithmica, 11:501-524, 1994.
34. R. Grossi, A. Orlandi, R. Raman, and S. S. Rao. More haste, less waste: Lowering the redundancy in fully indexable dictionaries. In Proc. 26th Symposium on Theoretical Aspects of Computer Science, pages 517-528, 2009.
35. P. Gupta, R. Janardan, M. Smid, and B. Dasgupta. The rectangle enclosure and point-dominance problems revisited. International Journal o Computational Geometry; Applications, 7:437-455, 1997. (Pubitemid 127528042)
36. Y. Han and M. Thorup. Integer sorting in O(n √lg lg n) expected time and linear space. In Proc. 43rd IEEE Symposium on Foundations of Computer Science, pages 135-144, 2002.
37. J. M. Hellerstein, E. Koutsoupias, D. P. Miranker, C. H. Papadimitriou, and V. Samoladas. On a model of indexability and its bounds for range queries. Journal of the ACM, 49(1):35-55, 2002.
38. J. JaJa, C. W. Mortensen, and Q. Shi. Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In Proc. 15th International Symposium on Algorithms and Computation, pages 558-568, 2004. (Pubitemid 39745107)
39. M. Karpinski and Y. Nekrich. Space efficient multi-dimensional range reporting. In Proc. 15th Annual Combinatorics and Computing Conference, pages 215-224, 2009.
40. D. G. Kirkpatrick and R. Seidel. Output-size sensitive algorithms for finding maximal vectors. In Proc. 1st ACM Symposium on Computational Geometry, pages 89-96, 1985.
41. H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. Journal of the ACM, 22:469-476, 1975.
42. G. Lagogiannis, C. Makris, and A. Tsakalidis. A new algorithm for rectangle enclosure reporting. Information Processing Letters, 72:177-182, 1999. (Pubitemid 32212946)
43. D. T. Lee and F. P. Preparata. An improved algorithm for the rectangle enclosure problem. Journa of Algorithms, 3:218-224, 1982.
44. G. S. Lueker. A data structure for orthogonal range queries. In Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 28-34, 1978.
45. C. Makris and A. Tsakalidis. Algorithms for three-dimensional dominance searching in linear space. Information Processing Letters, 66(6):277-283, 1998. (Pubitemid 128402337)
46. E. M. McCreight. Priority search trees. SIAM Journal on Computing, 14(2):257-276, 1985.
47. Y. Nekrich. A data structure for multi-dimensional range reporting. In Proc. 23rd ACM Symposium on Computational Geometry, pages 344-353, 2007. (Pubitemid 47582081)
48. Y. Nekrich. Orthogonal range searching in linear and almost-linear space. Computational Geometry: Theory and Applications, 42:342-351, 2009.
49. M. H. Overmars. Efficient data structures for range searching on a grid. Journal of Algorithms, 9:254-275, 1988.
50. M. Pacaron;traşcu. Succincter. In Proc. 49th IEEE Symposium on Foundations of Computer Science, pages 305-313, 2008.
51. M. Pǎtraşcu. Unifying the landscape of cell-probe lower bounds. In Proc. 49th IEEE Symposium on Foundations of Computer Science, pages 434-443, 2008.
52. M. Pǎtraşcu and M. Thorup. Time-space trade-offs for predecessor search. In Proc. 38th ACM Symposium on Theory of Computing, pages 232-240, 2006. (Pubitemid 44306557)
53. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
54. S. Subramanian and S. Ramaswamy. The P-range tree: a new data structure for range searching in secondary memory. In Proc. 6th ACM/SIAM Symposium on Discrete Algorithms, pages 378-387, 1995.
55. V. Vaishnavi and D. Wood. Data structures for the rectangle containment and enclosure problems. Computer Graphics and Image Processing, 13:372-384, 1980. (Pubitemid 11442245)
56. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6:80-82, 1977.
57. D. E. Vengroff and J. S. Vitter. Efficient 3-D range searching in external memory. In Proc. 28th ACM Symposium on Theory of Computing, pages 192-201, 1996.
58. D. E. Willard. Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems. Information and Computation, 82(1):45-64, 1989.