Advertisement

Computational Geometry

Introduction
  • Mark de Berg
  • Marc van Kreveld
  • Mark Overmars
  • Otfried Cheong Schwarzkopf

Abstract

Imagine you are walking on the campus of a university and suddenly you realize you have to make an urgent phone call. There are many public phones on campus and of course you want to go to the nearest one. But which one is the nearest? It would be helpful to have a map on which you could look up the nearest public phone, wherever on campus you are. The map should show a subdivision of the campus into regions, and for each region indicate the nearest public phone. What would these regions look like? And how could we compute them?

Keywords

Convex Hull Voronoi Diagram Computational Geometry Convex Polygon Floating Point Arithmetic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Mark de Berg
    • 1
  • Marc van Kreveld
    • 2
  • Mark Overmars
    • 2
  • Otfried Cheong Schwarzkopf
    • 2
  1. 1.Department of Computer ScienceTU EindhovenEindhoventhe Netherlands
  2. 2.Department of Computer ScienceUtrecht UniversityUtrechtThe Netherlands

Personalised recommendations