Persistent predecessor search and orthogonal point location on the word RAM

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 1131-1145

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; SPACE APPLICATIONS; SPACE PLATFORMS; TREES (MATHEMATICS);

BINARY SPACE PARTITION; GEOMETRIC APPLICATIONS; HIGHER-DIMENSIONAL; INSERTIONS AND DELETIONS; LINEAR SPACES; NON-ORTHOGONAL; PLANAR SUBDIVISION; POINT LOCATION;

QUERY PROCESSING;

EID: 79955709227     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.85     Document Type: Conference Paper

References (61)

1. P. Afshani. On dominance reporting in 3D. In Proc. 16th European Sympos. Algorithms, Lect. Notes Comput. Sci., vol. 5198, Springer-Verlag, 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 Sympos. Found. Comput. Sci., pages 149-158, 2009.
3. P. Afshani, L. Arge, and K. D. Larsen. Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher dimensional improvements. In Proc. 26th ACM Sympos. Comput. Geom., pages 240-246.
4. L. Aleksandrov and H. Djidjev. Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Discrete Math., 9:129-150, 1996. (Pubitemid 126579840)
5. S. Alstrup, G. Brodai, and T. Rauhe. New data structures for orthogonal range searching. In Proc. 41st IEEE Sympos. Found. Comput. Sci., pages 198-207, 2000. (Pubitemid 32075891)
6. S. Alstrup, G. Brodai, and T. Rauhe. Optimal static range reporting in one dimension. In Proc. 33rd ACM Sympos. Theory Comput., pages 476-483, 2001.
7. S. Alstrup, T. Husfeldt, and T. Rauhe. Marked ancestor problems. In Proc. 39th IEEE Sympos. Found. Comput. Sci., pages 534-543, 1998.
8. A. Amir, A. Efrat, P. Indyk, and H. Samet. Efficient regular data structures and algorithms for dilation, location, and proximity problems. Algorithmica, 30:164-187, 2001. (Pubitemid 33710361)
9. A. Andersson. Faster deterministic sorting and searching in linear space. In Proc. 37th IEEE Sympos. Found. Comput. Sci., pages 135-141, 1996.
10. A. Andersson and M. Thorup. Dynamic ordered sets with exponential search trees. J. ACM, 54(3):13, 2007.
11. P. Beame and F. Fich. Optimal bounds for the predecessor problem and related problems. J. Comput. Sys. Sci., 65:38-72, 2002.
12. M. A. Bender, R. Cole, E. D. Demaine, M. Farach-Colton, and J. Zito. Two simplified algorithms for maintaining order in a list. In Proc. 10th European Sympos. Algorithms, Lect. Notes Comput. Sci., vol. 2461, Springer-Verlag, pages 152-164, 2002.
13. M. A. Bender, R. Cole, and R. Raman. Exponential structures for efficient cache-oblivious algorithms. In Proc. 29th Int. Colloq. Automata, Languages, and Programming, Lect. Notes Comput. Sci., vol. 2380, Springer-Verlag, pages 195-207, 2002.
14. M. de Berg. Linear size binary space partitions for uncluttered scenes. Algorithmica, 28:353-366, 2000.
15. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2000.
16. M. de Berg, M. van Kreveld, and J. Snoeyink. Two-dimensional and three-dimensional point location in rectangular subdivisions. J. Algorithms, 18:256-277, 1995.
17. M. Cary. Towards optimal ε-approximate nearest neighbor algorithms. J. Algorithms, 41:417-428, 2001. (Pubitemid 33665549)
18. T. M. Chan. Closest-point problems simplified on the RAM. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 472-473, 2002.
19. T. M. Chan and M. Pǎtraşcu. Transdichotomous results in computational geometry, II: Offline search. ACM Trans. Algorithms, submitted. Preliminary version appeared in Proc. 39th ACM Sympos. Theory Comput., pages 31-39, 2007.
20. T. M. Chan and M. Pǎtraşcu. Transdichotomous results in computational geometry, I: Point location in sublogarithmic time. SIAM J. Comput., 39:703-729, 2009.
21. T. M. Chan and M. Pǎtraşcu. Counting inversions, offline orthogonal range counting, and related problems. In Proc. 21st ACM-SIAM Sympos. Discrete Algorithms, pages 161-173, 2010.
22. B. Chazelle. Filtering search: a new approach to query-answering. SIAM J. Comput., 15:703-724, 1986. (Pubitemid 16634090)
23. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485-524, 1991.
24. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
25. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 3rd ed., 2009.
26. P. F. Dietz. Maintaining order in a linked list. In Proc. 14th ACM Sympos. Theory Comput., pages 122-127, 1982.
27. P. F. Dietz. Fully persistent arrays. In Proc. 1st Workshop Algorithms Data Struct., Lect. Notes Comput. Sci., vol. 382, Springer-Verlag, pages 67-74, 1989.
28. P. F. Dietz and R. Raman. Persistence, amortization and randomization. In Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms, pages 78-88, 1991. Full version in Tech. Report 353, Computer Science Department, University of Rochester, 1990.
29. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proc. 19th ACM Sympos. Theory Comput., pages 365-372, 1987.
30. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. Tarjan. Dynamic perfect hashing: upper and lower bounds. SIAM J. Comput., 23:738-761, 1994.
31. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. J. Comput. Sys. Sci., 38:86-124, 1989.
32. A. Dumitrescu, J. S. B. Mitchell, and M. Sharir. Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. Discrete Comput. Geom., 31:207-227, 2004. (Pubitemid 38389604)
33. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett., 6:80-82, 1977.
34. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977.
35. D. Eppstein and S. Muthukrishnan. Internet packet filter management and rectangle geometry. In Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pages 827-835, 2001.
36. G. N. Frederickson. Data structures for on-line updating of minimum spanning trees. SIAM J. Comput., 14:781-798, 1985.
37. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput., 16:1004-1022, 1987.
38. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. Sys. Sci., 47:424-436, 1993.
39. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Sys. Sci., 48:533-551, 1994. (Pubitemid 124013302)
40. M. T. Goodrich. Planar separators and parallel polygon triangulation. J. Comput. Sys. Sci., 51:374-389, 1995.
41. T. Hagerup, P. B. Miltersen and R. Pagh. Deterministic dictionaries. J. Algorithms, 41:69-85, 2001. (Pubitemid 33667217)
42. Y. Han. Deterministic sorting in O (n √log log n) time and linear space. J. Algorithms, 50:96-105, 2004.
43. Y. Han and M. Thorup. Integer sorting in O(n√log log n) expected time and linear space. In Proc. 43rd IEEE Sympos. Found. Comput. Sci., pages 135-144, 2002.
44. J. Hershberger, S. Suri, and C. D. Tóth. Binary space partitions of orthogonal subdivisions. SIAM J. Comput., 34:1380-1397, 2005. (Pubitemid 43003147)
45. J. Iacono and S. Langerman. Dynamic point location in fat hyperrectangles with integer coordinates. In Proc. 12th Canad. Conf. Comput. Geom., pages 181- 186, 2000.
46. A. Itai, A. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Proc. 8th Int. Colloq. Automata, Languages, and Programming, Lect. Notes Comput. Sci., vol. 115, Springer-Verlag, pages 417-431, 1981.
47. H. Kaplan. Persistent data structures. In Handbook on Data Structures and Applications (D. Mehta and S. Sahni, eds.), CRC Press, 2005.
48. M. Karpinski and Y. Nekrich. Space efficient multidimensional range reporting. In Proc. 15th Int. Conf. Comput. Comb., Lect. Notes Comput. Sci., vol. 5609, Springer-Verlag, pages 215-224, 2009.
49. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12:28-35, 1983.
50. C. W. Mortensen, R. Pagh, and M. Pǎtraşcu. On dynamic range reporting in one dimension. In Proc. 37th ACM Sympos. Theory Comput., pages 104-111, 2005. (Pubitemid 43098577)
51. Y. Nekrich. A data structure for multi-dimensional range reporting. In Proc. 23rd ACM Sympos. Comput. Geom., pages 344-353, 2007. (Pubitemid 47582081)
52. Y. Nekrich. I/O-efficient point location in a set of rectangles. In Proc. 8th Latin American Sympos. Theoretical Informatics, Lect. Notes Comput. Sci., vol. 4957, Springer-Verlag, pages 687-698, 2008. (Pubitemid 351632227)
53. M. S. Paterson and F. F. Yao. Optimal binary space partitions for orthogonal objects. J. Algorithms, 13:99-113, 1992.
54. M. Pǎtraşcu. Unifying the landscape of cell-probe lower bounds. SIAM J. Comput., submitted. Also in Proc. 49th IEEE Sympos. Found. Comput. Sci., pages 434-443, 2008.
55. M. Pǎtraşcu and M. Thorup. Time-space trade-offs for predecessor search. In Proc. 38th ACM Sympos. Theory Comput., pages 232-240, 2006. (Pubitemid 44306557)
56. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
57. C. Schwarz, M. H. M. Smid, and J. Snoeyink. An optimal algorithm for the on-line closest-pair problem. Algorithmica, 12:18-29, 1994.
58. D. D. Sleator and R. E. Tarjan. Planar point location using persistent search trees. Commun. ACM, 29:669-679, 1986.
59. J. Snoeyink. Point location. In Handbook of Discrete and Computational Geometry (J. E. Goodman and J. O'Rourke, eds.), CRC Press, Boca Raton, FL, pages 559-574, 1997.
60. G. loth. Binary space partitions for axis-aligned fat rectangles. SIAM J. Comput., 38:429-447, 2008.
61. D. E. Willard. Log-logarithmic worst case range queries are possible in space G(n). Inform. Process. Lett.. 17:81-84, 1983.