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.
Chapter PDF
Similar content being viewed by others
References
J. Hopcroft, D. Joseph, and S. Whitesides. Movement problems for 2-dimensional linkages, SIAM J. Compt., 13: pp. 610–629, 1984.
J. Hopcroft, D. Joseph, and S. Whitesides. On the movement of robot arms in 2-dimensional bounded regions, SIAM J. Compt., 14: pp. 315–333, 1985.
V. Kantabutra. Motions of a short-linked robot arm in a square. Discrete and Compt. Geom., 7:pp. 69–76, 1992.
V. Kantabutra. Reaching a point with an unanchored robot arm in a square. International jou. of comp. geo. & app., 7(6):pp. 539–549, 1997.
A. Mohades and M. Razazi, Reachability On a Region by two Attached Squares, ICCS’01, USA, Lecture Notes in Computer Sc., Vol. 2120, 2001.
A. Mohades and M. Razazi, Reachability Problem in T-shaped Rectilinear Polygon, Proc. 2th Fun With Algorithms, Italy, pp.199–213, 2001. 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mohades, A., Shiri, M.E., Razzazi, M. (2003). The Reachability Problem in a Concave Region: A New Context. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44862-4_93
Download citation
DOI: https://doi.org/10.1007/3-540-44862-4_93
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40195-7
Online ISBN: 978-3-540-44862-4
eBook Packages: Springer Book Archive