Skip to main content
Book Chapter

Visibility Graphs

  • de Berg M
  • Cheong O
  • van Kreveld M
  • et al.
Springer Berlin Heidelberg, (2008), 323-333
DOI: 10.1007/978-3-540-77974-2_15
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

de Berg, M., Cheong, O., van Kreveld, M., & Overmars, M. (2008). Visibility Graphs. In Computational Geometry (pp. 323–333). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-77974-2_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free