Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n) Update Time

  • Gerth Stølting Brodal
  • Riko Jacob
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1851)

Abstract

The dynamic maintenance of the convex hull of a set of points in the plane is one of the most important problems in computational geometry. We present a data structure supporting point insertions in amortized O(log n · log log log n) time, point deletions in amortized O(log n · log log n) time, and various queries about the convex hull in optimal O(log n) worst-case time. The data structure requires O(n) space. Applications of the new dynamic convex hull data structure are improved deterministic algorithms for the k-level problem and the red-blue segment intersection problem where all red and all blue segments are connected.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Basch, L. J. Guibas, and G. Ramkumar. Reporting red-blue intersections between 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.Google Scholar
  2. 2.
    M. de Berg, M. van K., M. Overmars, and O. Schwarzkopf. Computational Geometry. Springer-Verlag, Berlin, 1997. Algorithms and applications.MATHGoogle Scholar
  3. 3.
    J. Bentley and J. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. Journal of Algorithms, 1:301–358, 1980.MATHCrossRefMathSciNetGoogle Scholar
  4. 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.Google Scholar
  5. 5.
    B. Chazelle. On the convex layers of a planar set. IEEE Trans. Inform. Theory, IT-31:509–517, 1985.MATHCrossRefMathSciNetGoogle Scholar
  6. 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.Google Scholar
  7. 7.
    H. Edelsbrunner and E. Welzl. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput., Vol. 15, No. 1, 1986.Google Scholar
  8. 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.Google Scholar
  9. 9.
    J. Hershberger and S. Suri. Applications of a semidynamic convex hull algorithm. BIT, 32:249–267, 1992.MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    J. Hershberger and S. Suri. Off-line maintenance of planar configurations. Journal of Algorithms, 21:453–475, 1996.MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    K. Mulmuley. Randomized multidimensional search trees: lazy balancing and dynamic shuffling. In Proc. 32nd Ann. Symp. on Foundations of Computer Science (FOCS), pages 180–196, 1991.Google Scholar
  12. 12.
    M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23:166–204, 1981.MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer Verlag, Berlin, 1985.Google Scholar
  14. 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.MATHCrossRefMathSciNetGoogle Scholar
  15. 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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Gerth Stølting Brodal
    • 1
  • Riko Jacob
    • 1
  1. 1.BRICS, Department of Computer ScienceUniversity of AarhusDenmark

Personalised recommendations