Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time
SCG '87 Proceedings of the third annual symposium on Computational geometry
Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An output-sensitive algorithm for computing visibility
SIAM Journal on Computing
On parallel rectilinear obstacle-avoiding paths
Computational Geometry: Theory and Applications
Rectilinear short path queries among rectangular obstacles
Information Processing Letters
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
SIAM Journal on Computing
Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Finding a rectilinear shortest path in R2using corridor based staircase structures
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A nearly optimal algorithm for finding L1shortest paths among polygonal obstacles in the plane
ESA'11 Proceedings of the 19th European conference on Algorithms
Computing the visibility polygon of an island in a polygonal domain
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Visibility and ray shooting queries in polygonal domains
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
The rectilinear shortest path problem can be stated as follows: given a set of m non-intersecting simple polygonal obstacles in the plane, find a shortest L"1-metric (rectilinear) path from a point s to a point t that avoids all the obstacles. The path can touch an obstacle but does not cross it. This paper presents an algorithm with time complexity O(n+m(lgn)^3^/^2), which is close to the known lower bound of @W(n+mlgm) for finding such a path. Here, n is the number of vertices of all the obstacles together.