Computing Homotopic Shortest Paths Efficiently
<|reference_start|>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.<|reference_end|>
@article{efrat2002computing,
    title={Computing Homotopic Shortest Paths Efficiently},
    author={Alon Efrat, Stephen G. Kobourov and Anna Lubiw},
    journal={arXiv preprint arXiv:cs/0204050},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0204050},
    primaryClass={cs.CG}
}