1-Link shortest paths in weighted regions

Ovidiu Daescu, James D Palmer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
Pages378-379
Number of pages2
DOIs
StatePublished - 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

Fingerprint

Shortest path
Optimal Solution
Subdivision
Search Methods
Efficient Algorithms
Software
Computing
Vertex of a graph

Keywords

  • Algorithms
  • Experimentation

ASJC Scopus subject areas

  • Software
  • Geometry and Topology
  • Safety, Risk, Reliability and Quality
  • Chemical Health and Safety

Cite this

Daescu, O., & Palmer, J. D. (2005). 1-Link shortest paths in weighted regions. In Proceedings of the Annual Symposium on Computational Geometry (pp. 378-379) https://doi.org/10.1145/1064092.1064155

1-Link shortest paths in weighted regions. / Daescu, Ovidiu; Palmer, James D.

Proceedings of the Annual Symposium on Computational Geometry. 2005. p. 378-379.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Daescu, O & Palmer, JD 2005, 1-Link shortest paths in weighted regions. in Proceedings of the Annual Symposium on Computational Geometry. pp. 378-379, 21st Annual Symposium on Computational Geometry, SCG'05, Pisa, Italy, 6/6/05. https://doi.org/10.1145/1064092.1064155
Daescu O, Palmer JD. 1-Link shortest paths in weighted regions. In Proceedings of the Annual Symposium on Computational Geometry. 2005. p. 378-379 https://doi.org/10.1145/1064092.1064155
Daescu, Ovidiu ; Palmer, James D. / 1-Link shortest paths in weighted regions. Proceedings of the Annual Symposium on Computational Geometry. 2005. pp. 378-379
@inproceedings{27b8742f661d4042a8a076528d108b3a,
title = "1-Link shortest paths in weighted regions",
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.",
keywords = "Algorithms, Experimentation",
author = "Ovidiu Daescu and Palmer, {James D}",
year = "2005",
doi = "10.1145/1064092.1064155",
language = "English (US)",
pages = "378--379",
booktitle = "Proceedings of the Annual Symposium on Computational Geometry",

}

TY - GEN

T1 - 1-Link shortest paths in weighted regions

AU - Daescu, Ovidiu

AU - Palmer, James D

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Algorithms

KW - Experimentation

UR - http://www.scopus.com/inward/record.url?scp=33244472361&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33244472361&partnerID=8YFLogxK

U2 - 10.1145/1064092.1064155

DO - 10.1145/1064092.1064155

M3 - Conference contribution

AN - SCOPUS:33244472361

SP - 378

EP - 379

BT - Proceedings of the Annual Symposium on Computational Geometry

ER -