Shortest Paths and Networks (original) (raw)
Related papers
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing, 1999
Approximation algorithms for geometric shortest path problems
2000
Shortest Paths Among Obstacles in the Plane
International Journal of Computational Geometry & Applications, 1996
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
Minimum-link paths among obstacles in the plane
Algorithmica, 1992
Minimum-link shortest paths for polygons amidst rectilinear obstacles
Computational Geometry
Curvature-constrained shortest paths in a convex polygon (extended abstract
1998
A New Dimension towards the Determination of Shortest Path for Robots using Convex Polygons
International Journal of Computer Applications, 2011
A near optimal algorithm for finding Euclidean shortest path in polygonal domain
ArXiv, 2010
Finding minimum rectilinear distance paths in the presence of barriers
Networks, 1981
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
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Curvature-Constrained Shortest Paths in a Convex Polygon
Siam Journal on Computing, 2002
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time
Symposium on Computational Geometry, 1987
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
SIAM Journal on Computing, 1992
The Shortest Path from Shortest Distance on a Polygon Mesh
2017
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
Shortest paths in simple polygons with polygon-meet constraints
2004
Geometric data structures approximations for network optimisation problems
2009
Minimal Construct: Efficient Shortest Path Finding for Mobile Robots in Polygonal Maps
2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Shortest Path Queries Between Geometric Objects on Surfaces
Jörg-rüdiger Sack, Anil Maheshwari
Lecture Notes in Computer Science, 2007
Query-point visibility constrained shortest paths in simple polygons
2007
An Appraisal of Some Shortest-Path Algorithms
Operations Research, 1969
A Survey of Shortest-Path Algorithms
ArXiv, 2017
Shortest paths in polygonal domains with polygon-meet constraints
2003
An Algorithm to Find Shortest Paths
Shortest paths among transient obstacles
Journal of Combinatorial Optimization, 2020
A locally optimal fast obstacle-avoiding path-planning algorithm
Mathematical Modelling, 1987
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
Approximate Euclidean Shortest Paths in Polygonal Domains
2019
The generalized shortest path problem
CiteSeer Archives, 2000
Approximating geometric bottleneck shortest paths
Computational Geometry, 2004
Planar spanners and approximate shortest path queries among obstacles in the plane
1996
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
Discrete and Computational Geometry, 2013