Dynamic planar convex hull with optimal query time and O(Log n · log log n) update time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1851, Issue , 2000, Pages 57-70

  Brodal, Gerth Stølting ^a   Jacob, Riko ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES;

CONVEX HULL; DETERMINISTIC ALGORITHMS; DYNAMIC MAINTENANCES; OPTIMAL QUERY; SEGMENT INTERSECTIONS;

ALGORITHMS;

EID: 84956861412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (15)

1. J. Basch, L. J. Guibas, and G. Ramkumar. Reporting red-blue intersections be-tween two sets of connected line segments. In Proc. 4th European Symposium on Algorithms, volume 1136 of Lecture Notes in Computer Science, pages 302-319. Springer Verlag, Berlin, 1996.
2. M. de Berg, M. van K. M. Overmars, and O. Schwarzkopf. Computational Geom-etry. Springer-Verlag, Berlin, 1997. Algorithms and applications.
3. J. Bentley and J. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. Journal of Algorithms, 1:301-358, 1980.
4. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. In Proc. 40th Ann. Symp. on Foundations of Computer Science (FOCS), pages 92-99, 1999.
5. B. Chazelle. On the convex layers of a planar set. IEEE Trans. Inform. Theory, IT-31:509-517, 1985.
6. Y.-J. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Proceedings of the IEEE, Special Issue on Computational Geometry, 80(9):1412-1434, 1992.
7. H. Edelsbrunner and E. Welzl. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput., Vol. 15, No. 1, 1986.
8. S. Har-Peled. Taking a walk in a planar arrangement. In Proc. 40th Ann. Symp. On Foundations of Computer Science (FOCS), pages 100-110, 1999.
9. J. Hershberger and S. Suri. Applications of a semidynamic convex hull algorithm. BIT, 32:249-267, 1992.
10. J. Hershberger and S. Suri. Off-line maintenance of planar configurations. Journal of Algorithms, 21:453-475, 1996.
11. K. Mulmuley. Randomized multidimensional search trees: lazy balancing and dy-namic shuffing. In Proc. 32nd Ann. Symp. on Foundations of Computer Science (FOCS), pages 180-196, 1991.
12. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23:166-204, 1981.
13. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer Verlag, Berlin, 1985.
14. F. P. Preparata and J. S. Vitter. A simplified technique for hidden-line elimination in terrains. International Journal of Computational Geometry & Applications, 3(2):167-181, 1993.
15. O. Schwarzkopf. Dynamic maintenance of geometric structures made easy. In Proc. 32nd Ann. Symp. on Foundations of Computer Science (FOCS), pages 197-206, 1991.