Approximate Euclidean Shortest Paths in Polygonal Domains (original) (raw)
Related papers
A near optimal algorithm for finding Euclidean shortest path in polygonal domain
ArXiv, 2010
An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
Discrete and Computational …, 1997
Approximation algorithms for geometric shortest path problems
2000
Approximating geometric bottleneck shortest paths
Computational Geometry, 2004
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing, 1999
Efficient computation of geodesic shortest paths
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
Algorithmica, 2002
Computing Shortest Paths in the Plane with Removable Obstacles
2018
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
Discrete and Computational Geometry, 2013
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces
Scandinavian Workshop on Algorithm Theory, 1998
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
Area-preserving approximations of polygonal paths
Journal of Discrete Algorithms, 2006
Approximation algorithms for geometric problems
1996
Geometric Approximation Algorithms and Randomized Algorithms for Planar Arrangements
Speed-Constrained Geodesic Fréchet Distance Inside a Simple Polygon
2010
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
Jörg-rüdiger Sack, Anil Maheshwari
Lecture Notes in Computer Science, 2006
Shortest Paths Among Obstacles in the Plane
International Journal of Computational Geometry & Applications, 1996
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
Discrete & Computational Geometry, 2016
Faster Approximations of Shortest Geodesic Paths on Polyhedra Through Adaptive Priority Queue
Hélio Pedrini, Pedro J de Rezende
Planar spanners and approximate shortest path queries among obstacles in the plane
1996
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
Computing geodesic furthest neighbors in simple polygons
Journal of Computer and System Sciences, 1989
A Time-space Trade-off for Computing the Geodesic Center of a Simple Polygon
ArXiv, 2019
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
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
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time
Symposium on Computational Geometry, 1987
H.: Fast exact and approximate geodesics on meshes
2010
A polynomial time algorithm for finding an approximate shortest path amid weighted regions
2015
Practical methods for approximating shortest paths on a convex polytope in R3
Computational Geometry, 1998
Thick non-crossing paths and minimum-cost flows in polygonal domains
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07, 2007
Determining approximate shortest paths on weighted polyhedral surfaces
Journal of the ACM, 2005
Shortest paths in polygonal domains with polygon-meet constraints
2003
Fast exact and approximate geodesics on meshes
2005