Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 19-28

  Giyora, Yoav ^a   Kaplan, Haim ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPARISON MODELING; INSERTIONS AND DELETIONS; LINE SEGMENT; OPTIMAL DYNAMICS; PLANAR SUBDIVISION; QUERY POINTS; RAY SHOOTING;

ALGORITHMS;

EID: 68549086203     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. P. Agarwal, L. Arge, and K. Yi. An optimal dynamic interval stabbing-max data structure? In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 803-812, 2005.
2. L. Arge, G. S. Brodal, and L. Georgiadis. Improved dynamic planar point location. In Proc. 47th IEEE Annual Symposium on Foundations of Computer Science (FOCS), 2006.
3. L. Arge and J. S. Vitter. Optimal external memory interval management. SIAM Journal on Computing, 32:1488-1508, 2003.
4. H. Baumgarten, H. Jung, and K. Mehlhorn. Dynamic point location in general subdivisions. J. of Algorithm, 17:342-380, 1994.
5. A. L. Buchsbaum and M. T. Goodrich. Threedimensional layes of maxima. Algorithmica, 39:275-286, 2004.
6. Timothy M. Chan. Point location in o(log n) time, voronoi diagrams in o(n log n) time, and other transdichotomous results in computational geometry. In Proc. 47th IEEE Annual Symposium on Foundations of Computer Science (FOCS), 2006.
7. S.W. Cheng and R. Janardan. New results on dynamic planar point location. SIAM Journal on Computing, 21:972-999, 1992.
8. 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:207-233, 1996.
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. E. D. Demaine, J. Iacono, and S. Langerman. Retroactive data structures. In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 274-283, 2004.
11. P. F. Dietz and R. Raman. Persistence, amortization and randomization. In Proc. 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 78-88, 1991.
12. M. L. Fredman and D. E. Willard. Transdichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48(3):533-551, 1994.
13. Y. Giyora. Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. Master's thesis, Dept. of Computer Science, Tel-Aviv University, ISRAEL, 2006.
14. M. T. Goodrich and R. Tamassia. Dynamic trees and dynamic point location. SIAM Journal on Computing, 28(2):612-636, 1998.
15. H. Kaplan, E. Molad, and R. E. Tarjan. Dynamic rectangular intersection with priorities. In Proc. 35th Annual ACM Symposium on Theory of Computing (STOC), pages 639-648. ACM Press, 2003.
16. K. Mehlhorn and S. Näher. Dynamic fractional cascading. Algorithmica, 5:215-241, 1990.
17. C. W. Mortensen. Fully dynamic two dimensional range and line segment intersection reporting in logarithmic time. In Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 618-627, 2003.
18. Mihai Patrascu. Planar point location in sublogarithmic time. In Proc. 47th IEEE Annual Symposium on Foundations of Computer Science (FOCS), 2006.
19. F. P. Preparata and R. Tamassia. Dynamic planar point location with optimal query time. Theoretical Computer Science, 74:94-114, 1990.
20. R. Raman. Eliminating Amortization: On Data Structures with Guaranteed Response Time. PhD thesis, Dept. of Computer Science, University of Rochester, 1992.
21. P. van Emde Boas. Preserving order in a forest in less than logarithmic time. Information Processing Letters, 6(3):80-82, 1977.
22. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977.
23. D. E. Willard. A density control algorithm for doing insertions and deletions in a sequencially ordered fine in good worst-case time. Information and computation, 97(2):150-174, 1992.