arXiv · 1903.06737
Shortest paths in arbitrary plane domains
Abstract
Let $Ω$ be a connected open set in the plane and $γ: [0,1] \to \overlineΩ$ a path such that $γ((0,1)) \subset Ω$. 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 $h_t$, for $t \in [0,1)$, satisfy $h_t((0,1)) \subset Ω$. 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
L. C. Hoehn, L. G. Oversteegen, E. D. Tymchatyn. 2019-03-15. Shortest paths in arbitrary plane domains. https://doi.org/10.4153/s0008414x20000784
Cite the original work for its findings. Save a collection to share your selection of sources.