Computing Homotopic Shortest Paths Efficiently

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Computational Geometry, I.3.5;F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31079

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0204050
 http://arxiv.org/abs/cs/0204050

Collections

arXiv