Skip to main content
SpringerLink
Log in

The convex hull problem on grids computational and combinatorial aspects

  • Chapter 3 Algorithmics
  • Conference paper
  • First Online:
Machines, Languages, and Complexity (IMYCS 1988)

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

Included in the following conference series:

  • 123 Accesses

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.

References

  1. Dittert, E.; M.J. O'Donnell: Lower bounds for sorting with realistic instruction sets. IEEE Trans.Comp. 34(1985), 311–317.

    Google Scholar 

  2. Karlsson,R.G.; M.H.Overmars: Scanline Algorithms on a Grid. Dep. of Comp. Science and Inf. Science, University of Linköping, Linköping 1986, Research Report LITH-IDA-86-30.

    Google Scholar 

  3. Kirkpatrick, D., Reisch, S.: Upper Bounds for Sorting Integers on Random Access Machines, Theoretical Computer Science 28(1984), 263–276.

    Google Scholar 

  4. Overmars,M.H.: Computational geometry on a grid an overview. Dep.of Comp. Sc., University of Utrecht, Utrecht 1987, Technical Report RUU-CS-87-4.

    Google Scholar 

  5. Preparata, F.P., M.I. Shamos: Computational Geometry, Springer 1985, New York.

    Google Scholar 

  6. Steele, J.M.; A.C. Yao: Lower bounds for algebraic decision trees. J. of Algorithms 3(1982), 1–8.

    Google Scholar 

  7. Unger, K.: The convex hull problem on special planar point sets. K.-Weierstraß-Institut Berlin, Berlin 1988, Report R-MATH-05/88.

    Google Scholar 

  8. Unger,K.:Another method for proving lower bounds in the model of k-th order decision trees, (in preparation).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Karl-Weierstraß-Institut für Mathematik, Mohrenstr. 39, 1086, Berlin, DDR

    Kristel Unger

Authors
  1. Kristel Unger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Dassow J. Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Unger, K. (1989). The convex hull problem on grids computational and combinatorial aspects. In: Dassow, J., Kelemen, J. (eds) Machines, Languages, and Complexity. IMYCS 1988. Lecture Notes in Computer Science, vol 381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015936

Download citation

  • DOI: https://doi.org/10.1007/BFb0015936

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51516-6

  • Online ISBN: 978-3-540-48203-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation