The reachability problem in a concave region: A new context

Abstract

In this paper we present an algorithm that moves a chain confined in a T-shaped rectilinear region from an initial configuration to a final configuration where the end point of chain reaches a given point p. This work is an extension of the our previous results in concave region. In our algorithm links my cross over one another and none of end points of the link chain are fixed. It is shown that the algorithm takes a quadratic time and works when a certain condition is satisfied. © Springer-Verlag Berlin Heidelberg 2003.