Computing Homotopic Shortest Paths Efficiently
arXiv:cs/0204050
Abstract
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.
12 pages, 11 figures