Computing Homotopic Shortest Paths Efficiently

Simple item page
dc.creatorEfrat, Alon
dc.creatorKobourov, Stephen G.
dc.creatorLubiw, Anna
dc.date2002-04-25
dc.date.accessioned2026-07-07T03:18:21Z
dc.date.available2026-07-07T03:18:21Z
dc.descriptionThis 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.
dc.description12 pages, 11 figures
dc.identifierhttps://arxiv.org/abs/cs/0204050
dc.identifierhttp://arxiv.org/abs/cs/0204050
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31079
dc.subjectComputational Geometry
dc.subjectI.3.5;F.2.2
dc.titleComputing Homotopic Shortest Paths Efficiently
dc.typetext

Files

Collections

arXiv