Approximation algorithms for geometric shortest path problems (original) (raw)
Related papers
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
Discrete and Computational Geometry, 2013
Determining approximate shortest paths on weighted polyhedral surfaces
Journal of the ACM, 2005
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing, 1999
An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
Lecture Notes in Computer Science, 1998
Approximating Shortest Paths on Weighted Polyhedral Surfaces
Algorithmica, 2001
Computing Shortest Paths in the Plane with Removable Obstacles
2018
An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
Discrete and Computational …, 1997
Shortest Paths Among Obstacles in the Plane
International Journal of Computational Geometry & Applications, 1996
A near optimal algorithm for finding Euclidean shortest path in polygonal domain
ArXiv, 2010
A polynomial time algorithm for finding an approximate shortest path amid weighted regions
2015
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces
Scandinavian Workshop on Algorithm Theory, 1998
An epsilon-Approximation Algorithm for Weighted Shortest Path Queries on Polyhedral Surfaces
European Workshop on Computational Geometry, 1998
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
Discrete and Computational Geometry, 2009
A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)
Proceedings of the thirteenth annual symposium on Computational geometry - SCG '97, 1997
Multi-criteria Shortest Paths in 3D among Vertical Obstacles
2019
Shortest Path Queries Between Geometric Objects on Surfaces
Jörg-rüdiger Sack, Anil Maheshwari
Lecture Notes in Computer Science, 2007
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
Jörg-rüdiger Sack, Anil Maheshwari
Lecture Notes in Computer Science, 2006
Practical methods for approximating shortest paths on a convex polytope in R3
Computational Geometry, 1998
A near-optimal algorithm for shortest paths among curved obstacles in the plane
Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13, 2013
Approximate Euclidean Shortest Paths in Polygonal Domains
2019
A Polynomial Time Algorithm to Compute an Approximate Weighted Shortest Path
arXiv: Computational Geometry, 2015
Approximate Shortest Path through a Weighted Planar Subdivision
Eprint Arxiv 1011 6498, 2010
Approximating geometric bottleneck shortest paths
Computational Geometry, 2004
Handbook of Discrete and Computational Geometry, Second Edition, 2004
Planar spanners and approximate shortest path queries among obstacles in the plane
1996
Efficient computation of geodesic shortest paths
An efficient parallel solution for Euclidean shortest path in three dimensions
1986
A Delaunay triangulation-based shortest path algorithm with O(n log n) time in the Euclidean plane
2012 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM), 2012
Shortest point-visible paths on polyhedral surfaces
2000
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
SIAM Journal on Computing, 1992
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time
Symposium on Computational Geometry, 1987
Minimum-link paths among obstacles in the plane
Algorithmica, 1992
Finding shortest paths on surfaces
1994
Weighted Region Shortest Path Problem
1999
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014