1-link shortest paths in weighted regions

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. Categories and Subject Descriptors I.3.5 [Computational Geometry and Object Modeling]: Geometric algorithms General Terms Algorithms, Experimentation

• Type: Conference
• Year: 2005
• Where: COMPGEOM
• Authors: Ovidiu Daescu, James D. Palmer
• Keywords: COMPGEOM 2005, Discrete Geometry, Link Solver, Link Solver Software, Optimal Solution