Advertisement

Visibility Graphs

Finding the Shortest Route
  • Mark de Berg
  • Marc van Kreveld
  • Mark Overmars
  • Otfried Cheong Schwarzkopf

Abstract

In Chapter 13 we saw how to plan a path for a robot from a given start position to a given goal position. The algorithm we gave always finds a path if it exists, but we made no claims about the quality of the path: it could make a large detour, or make lots of unnecessary turns. In practical situations we would prefer to find not just any path, but a good path.

Keywords

Short Path Short Path Problem Visibility Graph Goal Position Common Tangent 
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