1-link shortest paths in weighted regions

Authors:
Ovidiu Daescu;James D. Palmer
Affiliations:
The University of Texas at Dallas, Richardson, TX;The University of Texas at Dallas, Richardson, TX
Venue:
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Year:
2005

Citing 3
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
Computing Optimal Trajectories for Medical Treatment Planning and Optimization

ICCS '02 Proceedings of the International Conference on Computational Science-Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximate an optimal solution within a user specified precision. The theoretical foundation of the method is a result stating that an optimal solution goes through a vertex of the subdivision. This result provides a way to discretize the problem with respect to vertices of interest which in turn leads to efficient algorithms.