A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We present an algorithm for computing k-link rectilinear shortest paths among rectilinear obstacles in the plane. We extend the "continuous Dijkstra" paradigm to store the link distance information associated with each propagating "wavefront". Our algorithm runs in time O(kn log 2 n) and space O(kn), where n is the number of vertices of the obstacles. Previous algorithms for the problem had worst-case time complexity O(kn 2 ). Our algorithm builds a j-link shortest path map, rooted at a givendblp:conf/cccg/PolishchukM05 fatcat:wxvsm3f4o5dy3movkc72zhv4li