Planar rectilinear shortest path computation using corridors
The authors study the problem of finding a 2-dimensional rectilinear (\(L_1\)) shortest path between two points in a polygonal region comprising non-intersecting polygonal obstacles. They propose an algorithm that builds a restricted visibility graph and then applies Dijkstra's shortest path algorithm on this visibility graph [cf. \textit{J. Hershberger} and \textit{S. Suri}, SIAM J. Comput. 28, No.~6, 2215--2256 (1999; Zbl 0939.68157)]. A shorter version of the paper appeared in [Lecture Notes in Computer Science 4855, 412--423 (2007; Zbl 1135.68600)].
scientific article; zbMATH DE number 5595373