Faster algorithms for minimum-link paths with restricted orientations

Abstract

We give an O(n2log2n)-time algorithm for computing a minimum-link rectilinear path in an n-vertex rectilinear domain in three dimensions; the fastest previously known algorithm of [Wagner, Drysdale and Stein, 2009] has running time O(n2.5logn). We also present an algorithm to find a minimum-link C-oriented path in a C-oriented domain in the plane; our algorithm is simpler and more time-space efficient than the earlier one of [Adegeest, Overmars and Snoeyink, 1994]. © 2011 Springer-Verlag.