Computing Homotopic Shortest Paths Efficiently
Computational Geometry
2007-05-23 v1
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.
Cite
@article{arxiv.cs/0204050,
title = {Computing Homotopic Shortest Paths Efficiently},
author = {Alon Efrat and Stephen G. Kobourov and Anna Lubiw},
journal= {arXiv preprint arXiv:cs/0204050},
year = {2007}
}
Comments
12 pages, 11 figures