Improved dynamic planar point location

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 305-314

  Argem, Lars ^a   Brodal, Gerth Stølting ^a   Georgiadis, Loukas ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR SYSTEMS; QUERY PROCESSING;

DYNAMIC PLANAR POINT LOCATION; POLY-LOGARITHMIC;

DATA STRUCTURES;

EID: 38749154704     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.40     Document Type: Conference Paper

References (25)

1. H. Baumgarten, H. Jung, and K. Mehlhorn. Dynamic point location in general subdivisions. Journal of Algorithms, 17(3):342-380, 1994.
2. J. Bentley. A solution to Klee's rectangle problems, unpublished report, 1977.
3. J. L. Bentley and J. B. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. Journal of Algorithms, l(4):301-358, 1980.
4. M. R. Brown and R. E. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM Journal on Computing, 9(3):594-614, 1980.
5. B. Chazelle and L. J. Guibas. Fractional cascading: I. A data structure technique. Algorithmica, 1(2): 133-62, 1986.
6. S. W. Cheng and R. Janardan. New results on dynamic planar point location. SIAM Journal on Computing, 21(5), 1992.
7. Y.-J. Chiang, F. P. Preparata, and R. Tamassia. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. SIAM Journal on Computing, 25(1):207-233, 1996.
8. Y.-J. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Technical Report CS-91-24, Brown University, March 1991.
9. Y.-J. Chiang and R. Tamassia. Dynamization of the trapezoid method for planar point location in monotone subdivisions. International Journal of Computational Geometry and Applications, 2(3):311-333, 1992.
10. M. de Berg, M. van Krevald, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, Berlin, second edition, 2000.
11. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86-124, 1989.
12. H. Edelsbrunner. Dynamic data structure for orthogonal intersection queries. Technical Report Technical Report F59, Inst. Informationsverarb. Tech. Univ. Graz, Graz, Austria, 1980.
13. O. Fries. Suchen in dynamischen planaren Unterteilungen. PhD thesis, Universität des Saarlandes, 1990.
14. M. T. Goodrich and R. Tamassia. Dynamic trees and dynamic point location. SIAM Journal on Computing, 28(2):612-36, 1998.
15. H. Imai and T. Asano. Dynamic orthogonal segment intersection search. Journal of Algorithms, 8(1):1-18, 1987.
16. D. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal on Computing, 12(1):28-35, 1983.
17. K. Mehlhorn. Data structures and algorithms 1: sorting and searching. Springer-Verlag New York, Inc., New York, NY, USA, 1984.
18. K. Mehlhorn and S. Näher. Dynamic fractional cascading. Algorithmica, 5(2):215-41, 1990.
19. K. Mehlhorn, S. Näher, and H. Alt. A lower bound on the complexity of the union-split-find problem. SIAM Journal on Computing, 17(6):1093-1102, 1988.
20. C. W. Mortensen, R. Pagh, and M. Pǎtraşcu. On dynamic range reporting in one dimension. In Proc. 37th ACM Symp. on Theory of Computing, pages 104-111, 2005.
21. M. H. Overmars. Range searching in a set of line segments. In Proc. 1st ACM Symp. on Computational Geometry, pages 177-185, 1985.
22. F. P. Preparata and R. Tamassia. Fully dynamic point location in a monotone subdivision. SIAM Journal on Computing, 18(4):811-830, 1989.
23. F. P. Preparata and R. Tamassia. Dynamic planar point location with optimal query time. Theoretical Computer Science, 74(1):95-114, 1990.
24. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Communications of the ACM, 29(7):669-679, 1986.
25. D. E. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time. Information and Computation, 97(2):150-204, 1992.