Computing homotopic shortest paths efficiently

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

We give deterministic and randomized algorithms to find shortest paths homotopic to a given collection Π of disjoint paths that wind amongst n point obstacles in the plane. Our deterministic algorithm runs in time O(k out+k inlogn+n√n), and the randomized algorithm runs in expected time O(k out+k inlogn+n(logn) 1+ε). Here k in is the number of edges in all the paths of Π, and k out is the number of edges in the output paths.

Original languageEnglish (US)
Pages (from-to)162-172
Number of pages11
JournalComputational Geometry: Theory and Applications
Volume35
Issue number3
DOIs
StatePublished - Oct 2006

Fingerprint

Deterministic Algorithm
Randomized Algorithms
Shortest path
Path
Disjoint Paths
Computing
Output

Keywords

  • Homotopic shortest paths
  • Shortest path in a polygon

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Computational Mathematics
  • Control and Optimization
  • Geometry and Topology

Cite this

Computing homotopic shortest paths efficiently. / Efrat, Alon; Kobourov, Stephen G; Lubiw, Anna.

In: Computational Geometry: Theory and Applications, Vol. 35, No. 3, 10.2006, p. 162-172.

Research output: Contribution to journalArticle

@article{db2a4e7f133c41cc8a62e428f8275f69,
title = "Computing homotopic shortest paths efficiently",
abstract = "We give deterministic and randomized algorithms to find shortest paths homotopic to a given collection Π of disjoint paths that wind amongst n point obstacles in the plane. Our deterministic algorithm runs in time O(k out+k inlogn+n√n), and the randomized algorithm runs in expected time O(k out+k inlogn+n(logn) 1+ε). Here k in is the number of edges in all the paths of Π, and k out is the number of edges in the output paths.",
keywords = "Homotopic shortest paths, Shortest path in a polygon",
author = "Alon Efrat and Kobourov, {Stephen G} and Anna Lubiw",
year = "2006",
month = "10",
doi = "10.1016/j.comgeo.2006.03.003",
language = "English (US)",
volume = "35",
pages = "162--172",
journal = "Computational Geometry: Theory and Applications",
issn = "0925-7721",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Computing homotopic shortest paths efficiently

AU - Efrat, Alon

AU - Kobourov, Stephen G

AU - Lubiw, Anna

PY - 2006/10

Y1 - 2006/10

N2 - We give deterministic and randomized algorithms to find shortest paths homotopic to a given collection Π of disjoint paths that wind amongst n point obstacles in the plane. Our deterministic algorithm runs in time O(k out+k inlogn+n√n), and the randomized algorithm runs in expected time O(k out+k inlogn+n(logn) 1+ε). Here k in is the number of edges in all the paths of Π, and k out is the number of edges in the output paths.

AB - We give deterministic and randomized algorithms to find shortest paths homotopic to a given collection Π of disjoint paths that wind amongst n point obstacles in the plane. Our deterministic algorithm runs in time O(k out+k inlogn+n√n), and the randomized algorithm runs in expected time O(k out+k inlogn+n(logn) 1+ε). Here k in is the number of edges in all the paths of Π, and k out is the number of edges in the output paths.

KW - Homotopic shortest paths

KW - Shortest path in a polygon

UR - http://www.scopus.com/inward/record.url?scp=84867977487&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867977487&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2006.03.003

DO - 10.1016/j.comgeo.2006.03.003

M3 - Article

VL - 35

SP - 162

EP - 172

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 3

ER -