Skip to main content
Springer Nature Link
Log in

Four results on randomized incremental constructions

  • Conference paper
  • First Online:
STACS 92 (STACS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 577))

Included in the following conference series:

  • 161 Accesses

Abstract

We prove four results on randomized incremental constructions (RICs):

  • an analysis of the expected behavior under insertion and deletions,

  • a fully dynamic data structure for convex hull maintenance in arbitrary dimensions,

  • a tail estimate for the space complexity of RICs,

  • a lower bound on the complexity of a game related to RICs.

A full version of this extended abstract is available from the authors.

Supported in part by ESPRIT II Basic Research Actions Program of the EC under contract no. 3075(projcct ALCOM)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J.D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete and Computational Geometry. To be published. Available as Technical Report INRIA 1285. Abstract published in IMACS 91 in Dublin.

    Google Scholar 

  2. B. Chazelle, H. Edelsbrunner, L.J. Guibas, M. Sharir, and J. Snoeyink. Computing a face in an arrangement of line segments. 2nd Ann. AGM-SIAM Symp. on Discrete Algorithms, pages 441–448, 1991.

    Google Scholar 

  3. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Journal of Discrete and Computational Geometry, pages 387–421, 1989.

    Google Scholar 

  4. O. Devillers. Randomization yields simple o(n log* n) algorithms for difficult Ω(n) problems. International Journal on Computational Geometry and Aplications. To be published. Full paper available as Technical Report INRIA 1412. Abstract published in the Third Canadian Conference on Computational Geometry 1991 in Vancouver.

    Google Scholar 

  5. O. Devillers, S. Meiser, and M. Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. In WADS 91, volume LNCS 519. Springer Verlag, 1991. Full version available as Technical Report INRIA 1349.

    Google Scholar 

  6. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer Berlin-Heidelberg, 1987.

    Google Scholar 

  7. L.J. Guibas, D.E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Proc. of ICALP, pages 414–431, 1990. also to appear in Algorithmica.

    Google Scholar 

  8. K. Mehlhorn, St. Meiser, and C. Ò'Dunlaing. On the construction of abstract voronoi diagrams. Discrete Comput. Geom., 6:211–224, 1991.

    Google Scholar 

  9. K. Mehlhorn and St. Näher. Bounded ordered dictionaries in O(loglog n) time and O(n) space. Information Processing Letters, 35:183–189, 1990.

    Google Scholar 

  10. K. Mulmuley. A fast planar partition algorithm, I. Proc. of the 29th FOCS, pages 580–589, 1988.

    Google Scholar 

  11. K. Mulmuley. Randomized multidimensional search trees: dynamic sampling. Proc. ACM Symposium on Computational Geometry, 1991.

    Google Scholar 

  12. K. Mulmuley. Randomized multidimensional search trees: further results in dynamic sampling. 32nd IEEE FOCS, pages 216–227, 1991.

    Google Scholar 

  13. K. Mulmuley. Randomized multidimensional search trees: Lazy balancing and dynamic shuffling. 32nd IEEE FOCS, pages 180–194, 1991.

    Google Scholar 

  14. O. Schwarzkopf. Dynamic maintenance of geometric structures made easy. 32nd IEEE FOCS, pages 197–206, 1991.

    Google Scholar 

  15. R. Seidel. Linear programming and convex hulls made easy. Proc. 6th Ann. ACM Symp. Computational Geometry, pages 211–215, 1990.

    Google Scholar 

  16. R. Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Computational Geometry: Theory and Applications, 1:51–64, 1991.

    Google Scholar 

  17. A. J. Stolfi. Oriented projective geometry (extended abstract). Proceedings of the 3rd Annual ACM Symp. on Computational Geometry, pages 76–85, 1987.

    Google Scholar 

  18. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Systems Theory, 10:99–127, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Laboratories, USA

    Kenneth L. Clarkson

  2. Max Planck Institut für Informatik and Universität des Saarlandes, Germany

    Kurt Mehlhorn

  3. Computer Science Division, University of California at Berkeley, USA

    Raimund Seidel

Authors
  1. Kenneth L. Clarkson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kurt Mehlhorn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raimund Seidel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alain Finkel Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clarkson, K.L., Mehlhorn, K., Seidel, R. (1992). Four results on randomized incremental constructions. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_205

Download citation

  • DOI: https://doi.org/10.1007/3-540-55210-3_205

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55210-9

  • Online ISBN: 978-3-540-46775-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics