1-Link shortest paths in weighted regions

Ovidiu Daescu, James D. Palmer

Research output: Contribution to conferencePaper

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.

Original languageEnglish (US)
Pages378-379
Number of pages2
DOIs
StatePublished - Dec 1 2005
Externally publishedYes
Event21st Annual Symposium on Computational Geometry, SCG'05 - Pisa, Italy
Duration: Jun 6 2005Jun 8 2005

Other

Other21st Annual Symposium on Computational Geometry, SCG'05
CountryItaly
CityPisa
Period6/6/056/8/05

Keywords

  • Algorithms
  • Experimentation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of '1-Link shortest paths in weighted regions'. Together they form a unique fingerprint.

  • Cite this

    Daescu, O., & Palmer, J. D. (2005). 1-Link shortest paths in weighted regions. 378-379. Paper presented at 21st Annual Symposium on Computational Geometry, SCG'05, Pisa, Italy. https://doi.org/10.1145/1064092.1064155