On the complexity of optimal homotopies [chapter]

Erin Wolf Chambers, Arnaud de Mesmay, Tim Ophelders
2018 Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms  
In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More precisely, given two homotopic curves γ 1 and γ 2 on a combinatorial (say, triangulated) surface, we investigate the problem of computing a homotopy between γ 1 and γ 2 where the length of the longest intermediate curve is minimized. Such optimal homotopies
more » ... re relevant for a wide range of purposes, from very theoretical questions in quantitative homotopy theory to more practical applications such as similarity measures on meshes and graph searching problems. We prove that Homotopy Height is in the complexity class NP, and the corresponding exponential algorithm is the best one known for this problem. This result builds on a structural theorem on monotonicity of optimal homotopies, which is proved in a companion paper. Then we show that this problem encompasses the Homotopic Fréchet distance problem which we therefore also establish to be in NP, answering a question which has previously been considered in several different settings. We also provide an O(log n)-approximation algorithm for Homotopy Height on surfaces by adapting an earlier algorithm of Har-Peled, Nayyeri, Salvatipour and Sidiropoulos in the planar setting.
doi:10.1137/1.9781611975031.73 dblp:conf/soda/ChambersMO18 fatcat:bv4n5epbm5dcfiv2t6xhhlu7eq