2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31079This paper addresses the problem of finding shortest paths homotopic to a given disjoint set of paths that wind amongst point obstacles in the plane. We present a faster algorithm than previously known.12 pages, 11 figuresComputational GeometryI.3.5;F.2.2text