Approximation algorithms for geometric shortest path problems
From MaRDI portal
Publication:3191995
DOI10.1145/335305.335339zbMATH Open1296.68173OpenAlexW1980197133MaRDI QIDQ3191995FDOQ3191995
Authors: Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack 
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
Recommendations
- Fundamentals of Computation Theory
- Approximating geometric bottleneck shortest paths
- scientific article; zbMATH DE number 1962800
- scientific article; zbMATH DE number 1302178
- Geometric k Shortest Paths
- Lower bounds for computing geometric spanners and approximate shortest paths
- Efficient computation of geodesic shortest paths
- scientific article; zbMATH DE number 1424303
- Computing approximate shortest paths on convex polytopes
- scientific article; zbMATH DE number 871939
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (23)
- A survey of geodesic paths on 3D surfaces
- Approximating shortest paths on weighted polyhedral surfaces
- Approximating the integral Fréchet distance
- Line facility location in weighted regions
- Line Segment Facility Location in Weighted Subdivisions
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- On approximating shortest paths in weighted triangular tessellations
- Shortest path geometric rounding
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
- Fast Algorithms for Geometric Traveling Salesman Problems
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- On approximating shortest paths in weighted triangular tessellations
- Shortest monotone descent path problem in polyhedral terrain
- Approximation algorithms for shortest descending paths in terrains
- Geometric k Shortest Paths
- An experimental study of weighted \(k\)-link shortest path algorithms
- A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
- Efficient computation of geodesic shortest paths
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
- Navigating weighted regions with scattered skinny tetrahedra
- Fundamentals of Computation Theory
- Path refinement in weighted regions
- Precision-Sensitive Euclidean Shortest Path in 3-Space
This page was built for publication: Approximation algorithms for geometric shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191995)
