Finding Shortest Paths With Computational Geometry

DOI10.7155/JGAA.00071MaRDI QIDQ4679070zbMATH OpenOpenAlexFDO

Authors Po-Shen Loh

Publication date 25 May 2005

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/51534

zbMATH Keywords

heuristic search algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A shortest-path algorithm for Manhattan graphs
• Efficient computation of geodesic shortest paths
• An O(n log n) Manhattan path algorithm
• Computing the shortest path: A^ search meets graph theory
• A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane

Cited in

(12)

• A shortest-path algorithm for Manhattan graphs
• Shortest path geometric rounding
• Efficient computation of geodesic shortest paths
• scientific article; zbMATH DE number 176771 (Why is no real title available?)
• Computing homotopic shortest paths in the plane
• Finding Shortest Triangular Path and its Family inside a Digital Object
• Drawing Shortest Paths in Geodetic Graphs
• Drawing Shortest Paths in Geodetic Graphs
• Geometric k Shortest Paths
• Finding Shortest Triangular Path in a Digital Object
• Fundamentals of Computation Theory
• An O(n log n) Manhattan path algorithm

This page was built for publication: Finding Shortest Paths With Computational Geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679070)