Approximate Shortest Homotopic Paths in Weighted Regions

Abstract
Let P be a path between two points s and t in a polygonal subdivision T with obstacles and weighted regions. Given a relative error tolerance ε ∈(0,1), we present the first algorithm to compute a path between s and t that can be deformed to P without passing over any obstacle and the path cost is within a factor 1 + ε of the optimum. The running time is O(h 3/ε2 kn polylog(k, n, 1/ε)), where k is the number of segments in P and h and n are the numbers of obstacles and vertices in T, respectively. The constant in the running time of our algorithm depends on some geometric parameters and the ratio of the maximum region weight to the minimum region weight. © 2010 Springer-Verlag.

Citation
Cheng S-W, Jin J, Vigneron A, Wang Y (2010) Approximate Shortest Homotopic Paths in Weighted Regions. Lecture Notes in Computer Science: 109–120. Available: http://dx.doi.org/10.1007/978-3-642-17514-5_10.

Acknowledgements
Department of Computer Science and Engineering, HKUST, Hong Kong

Publisher
Springer Nature

Journal
Lecture Notes in Computer Science

DOI
10.1007/978-3-642-17514-5_10

Permanent link to this record