Euclidean Shortest Paths

Abstract

This introductory chapter explains the difference between shortest paths in finite graphs and shortest paths in Euclidean geometry, which is also called ‘the common geometry of our world’. The chapter demonstrates the diversity of such problems, defined between points in a plane, on a surface, or in the 3-dimensional space.