From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy

Abstract

Let $\gamma$ be a generic closed curve in the plane. Samuel Blank, in his 1967 Ph.D. thesis, determined if $\gamma$ is self-overlapping by geometrically constructing a combinatorial word from $\gamma$. More recently, Zipei Nie, in an unpublished manuscript, computed the minimum homotopy area of $\gamma$ by constructing a combinatorial word algebraically. We provide a unified framework for working with both words and determine the settings under which Blank's word and Nie's word are equivalent. Using this equivalence, we give a new geometric proof for the correctness of Nie's algorithm. Unlike previous work, our proof is constructive which allows us to naturally compute the actual homotopy that realizes the minimum area. Furthermore, we contribute to the theory of self-overlapping curves by providing the first polynomial-time algorithm to compute a self-overlapping decomposition of any closed curve $\gamma$ with minimum area.