\(L_{1}\) cheapest paths in ``Fjord scenery

DOI10.1016/J.EJOR.2003.03.003zbMath1176.90607OpenAlexW2019429123MaRDI QIDQ706968

M. Pordzik, Władysław Kulpa, Marian Turzański, Leslaw Socha

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.03.003

zbMATH Keywords

shortest pathDijkstra algorithmPoincare theoremTopographical map with cellular decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• A new algorithm for shortest paths among obstacles in the plane
• Estimation and determination of shortest path length in a road network with obstacles
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane

This page was built for publication: \(L_{1}\) cheapest paths in ``Fjord scenery