Computing Homotopic Shortest Paths Efficiently
  This 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. 
Alon Efrat, Stephen G. Kobourov and Anna Lubiw