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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Visibility Graphs. In: Computational Geometry. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77974-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-77974-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77973-5
Online ISBN: 978-3-540-77974-2
eBook Packages: Computer ScienceComputer Science (R0)