Computing Homotopic Shortest Paths Efficiently
Efrat, Alon · Kobourov, Stephen G. · Lubiw, Anna
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.