Approximation algorithms for geometric shortest path problems

DOI10.1145/335305.335339zbMath1296.68173OpenAlexW1980197133MaRDI QIDQ3191995

Jörg-Rüdiger Sack, Lyudmil Aleksandrov, Anil Maheshwari

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335339

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (14)

Approximating the integral Fréchet distance ⋮ Curve matching, time warping, and light fields: New algorithms for computing similarity between curves ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ An approximation algorithm for computing shortest paths in weighted 3-d domains ⋮ Shortest monotone descent path problem in polyhedral terrain ⋮ Approximating generalized distance functions on weighted triangulated surfaces with applications ⋮ A survey of geodesic paths on 3D surfaces ⋮ An Experimental Study of Weighted k-Link Shortest Path Algorithms ⋮ Line facility location in weighted regions ⋮ Approximation algorithms for shortest descending paths in terrains ⋮ On approximating shortest paths in weighted triangular tessellations ⋮ Path refinement in weighted regions ⋮ Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications ⋮ Line Segment Facility Location in Weighted Subdivisions

This page was built for publication: Approximation algorithms for geometric shortest path problems