Computing homotopic shortest paths efficiently

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Scopus citations

Abstract

We give algorithms to find shortest paths homotopic to given disjoint paths that wind amongst n point obstacles in the plane. Our deterministic algorithm runs in time O(k log n+n√n), and the randomized version in time O(k log n + n(logn)1+ε), where k is the input plus output sizes of the paths.

Original languageEnglish (US)
Title of host publicationAlgorithms - ESA 2002 - 10th Annual European Symposium, Proceedings
EditorsRolf Möhring, Rajeev Raman
PublisherSpringer-Verlag
Pages411-423
Number of pages13
ISBN (Electronic)3540441808, 9783540441809
DOIs
StatePublished - Jan 1 2002
Event10th Annual European Symposium on Algorithms, ESA 2002 - Rome, Italy
Duration: Sep 17 2002Sep 21 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2461
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th Annual European Symposium on Algorithms, ESA 2002
CountryItaly
CityRome
Period9/17/029/21/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Computing homotopic shortest paths efficiently'. Together they form a unique fingerprint.

Cite this