Skip to main content

Introduction to geometric computing: From algorithms to software

  • Chapter
  • First Online:
Algorithmic Foundations of Geographic Information Systems (CISM School 1996)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry. Springer, 1997.

    Google Scholar 

  2. S. Fortune. A sweepline algorithm for Voronoi diagrams. In Proc. 2nd Annu. ACM Sympos. Comput. Geom., pages 313–322, 1986.

    Google Scholar 

  3. K. Hinrichs, J. Nievergelt, and P. Schorn. Plane-sweep solves the closest pair problem elegantly. Inform. Process. Lett., 26:255–261, 1988.

    Google Scholar 

  4. K. Hinrichs, J. Nievergelt, and P. Schorn. An all-round sweep algorithm for 2-dimensional nearest-neighbor problems. In Acta Informatica, volume 29, pages 383–394, 1992.

    Google Scholar 

  5. R. Klein. Algorithmische Geometrie. Addision-Wesley, 1997.

    Google Scholar 

  6. K. Mehlhorn. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, volume 3 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1984.

    Google Scholar 

  7. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1994.

    Google Scholar 

  8. J. Nievergelt and K. Hinrichs. Algorithms and Data Structures, with Applications to Graphics and Geometry. Prentice-Hall, 1993.

    Google Scholar 

  9. J. Nievergelt. Complexity, algorithms, programs, systems: The shifting focus. In Proc. ALCOM Workshop on Algorithms: Implementation, Libraries, and Use, J. Symbolic Computation, volume 17, pages 297–310, 1994.

    Google Scholar 

  10. Jürg Nievergelt, Peter Schorn, Michele de Lorenzi, Christoph Ammann, and Adrian Brüngger. XYZ: A project in experimental geometric computation. In Computational Geometry — Methods, Algorithms and Appli cations: Proc. Internat. Workshop Comput. Geom. CG '91, volume 553 of Lecture Notes in Computer Science, pages 171–186. Springer-Verlag, 1991.

    Google Scholar 

  11. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.

    Google Scholar 

  12. P. Schorn. The XYZ GeoBench for the experimental evaluation of geometric algorithms. In DIMACS Workshop on Computational Support for Discrete Mathematics, 1992. [SH75] M. I. Shamos and D. Hoey. Closest-point problems. In Proc. 16th Annu. IEEE Sympos. Found. Comput. Sci., pages 151–162, 1975.

    Google Scholar 

  13. P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 4:101–115, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marc van Kreveld Jürg Nievergelt Thomas Roos Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Nievergelt, J. (1997). Introduction to geometric computing: From algorithms to software. In: van Kreveld, M., Nievergelt, J., Roos, T., Widmayer, P. (eds) Algorithmic Foundations of Geographic Information Systems. CISM School 1996. Lecture Notes in Computer Science, vol 1340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63818-0_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-63818-0_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69653-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics