Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions

Authors:
Ovidiu Daescu;Joseph S. B. Mitchell;Simeon Ntafos;James D. Palmer;Chee K. Yap
Affiliations:
The University of Texas at Dallas, Richardson, TX;Stony Brook University, Stony Brook, NY;The University of Texas at Dallas, Richardson, TX;The University of Texas at Dallas, Richardson, TX;New York University, New York, NY
Venue:
Proceedings of the twenty-second annual symposium on Computational geometry
Year:
2006

Citing 4
Cited 0

The weighted region problem: finding shortest paths through a weighted planar subdivision

Journal of the ACM (JACM)
Improved Optimal Weighted Links Algorithms

ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Determining approximate shortest paths on weighted polyhedral surfaces

Journal of the ACM (JACM)
k-link shortest paths in weighted subdivisions

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

This video illustrates the k-LinkSolver software for computing k-link shortest paths in weighted regions. The k-LinkSolver implements methods to find paths of length at most (1+ε) times the length of a shortest k-link path, for any fixed ε0, and having at most 2k−1 links. The methods implemented are an improvement over the previously known (1+ε)-approximation algorithms, which guarantee at most 5k−2 links.