Shortest paths in arbitrary plane domains
Abstract
Let be a connected open set in the plane and γ: [0,1] a path such that γ((0,1)) ⊂ . We show that the path γ can be ``pulled tight'' to a unique shortest path which is homotopic to γ, via a homotopy h with endpoints fixed whose intermediate paths ht, for t ∈ [0,1), satisfy ht((0,1)) ⊂ . We prove this result even in the case when there is no path of finite Euclidean length homotopic to γ under such a homotopy. For this purpose, we offer three other natural, equivalent notions of a ``shortest'' path. This work generalizes previous results for simply connected domains with simple closed curve boundaries.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.