Computing Homotopic Shortest Paths Efficiently

Authors:
Alon Efrat;Stephen G. Kobourov;Anna Lubiw
Affiliations:
-;-;-
Venue:
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Year:
2002

Citing 9
Cited 9

Algorithms for routing and testing routability of planar VLSI layouts

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On continuous Homotopic one layer routing

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The design and analysis of spatial data structures

The design and analysis of spatial data structures
Computing minimum length paths of a given homotopy class

Computational Geometry: Theory and Applications
Testing Homotopy for paths in the plane

Proceedings of the eighteenth annual symposium on Computational geometry
Growing fat graphs

Proceedings of the eighteenth annual symposium on Computational geometry
Drawing with Fat Edges

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
A theorem on polygon cutting with applications

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
River Routing Every Which Way, But Loose

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Computing homotopic shortest paths in the plane

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Computing homotopic shortest paths in the plane

Journal of Algorithms
Schematization of networks

Computational Geometry: Theory and Applications
Trajectory planning for lab robots based on global vision and Voronoi roadmaps

Robotica
Tightening non-simple paths and cycles on surfaces

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Thick non-crossing paths and minimum-cost flows in polygonal domains

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Mutually visible agents in a discrete environment

ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Schematization of networks

Computational Geometry: Theory and Applications
Optimal paths for mutually visible agents

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.02

Visualization

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(log n)1+驴), where k is the input plus output sizes of the paths.