Skip to main content
SpringerLink
Log in

Geometric algorithms and their complexity

  • Geometric Algorithms
  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1991)

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

Included in the following conference series:

  • 161 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.

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Freiburg, Rheinstr. 10–12, W-7800, Freiburg, Germany

    Thomas Ottmann

Authors
  1. Thomas Ottmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Oliver Günther Hans-Jörg Schek

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ottmann, T. (1991). Geometric algorithms and their complexity. In: Günther, O., Schek, HJ. (eds) Advances in Spatial Databases. SSD 1991. Lecture Notes in Computer Science, vol 525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54414-3_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-54414-3_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54414-2

  • Online ISBN: 978-3-540-47615-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation