On reconfiguring tree linkages: Trees can lock

It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex. This result cannot be extended to tree linkages: we show that there are trees with two simple configurations that are not connected by a motion that preserves simplicity throughout the motion. Indeed, we prove that an N-link tree can have 2 (N) equivalence classes of configurations.

[1]  Hazel Everett,et al.  Convexifying star-shaped polygons , 1998, CCCG.

[2]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[3]  Joseph O'Rourke.  Computational Geometry Column 39 , 2000, Int. J. Comput. Geom. Appl..

[4]  John E. Hopcroft,et al.  Movement Problems for 2-Dimensional Linkages , 1984, SIAM J. Comput..

[5]  Erik D. Demaine,et al.  Convexifying Monotone Polygons , 1999, ISAAC.

[6]  Vitit Kantabutra,et al.  New Algorithms for Multilink Robot Arms , 1986, J. Comput. Syst. Sci..

[7]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[8]  Erik D. Demaine,et al.  Locked and unlocked polygonal chains in 3D , 1998, SODA '99.

[9]  Sue Whitesides,et al.  Algorithmic Issues in the Geometry of Planar Linkage Movement , 1992, Aust. Comput. J..

[10]  Ileana Streinu,et al.  A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  M. Kapovich,et al.  On the moduli space of polygons in the Euclidean plane , 1995 .

[12]  Günter Rote,et al.  Straightening polygonal arcs and convexifying polygonal cycles , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[13]  Marc J. van Kreveld,et al.  Folding rulers inside triangles , 1993, CCCG.

[14]  Sue Whitesides,et al.  Reconfiguring closed polygonal chains in Euclideand-space , 1995, Discret. Comput. Geom..

[15]  John E. Hopcroft,et al.  On the movement of robot arms in 2-dimensional bounded regions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[16]  Naixun Pei,et al.  On the reconfiguration and reachability of chains , 1997 .

[17]  James U. Korein,et al.  A geometric investigation of reach , 1985 .

[18]  Joseph O'Rourke,et al.  Polygonal chains cannot lock in 4d , 1999, CCCG.

[19]  Sue Whitesides,et al.  On folding rulers in regular polygons , 1997, CCCG.

[20]  Edited Rob Kirby,et al.  Problems in Low-Dimensional Topology , 1995 .

[21]  Frank Quinn,et al.  Problems in low-dimensional topology , 1997 .

[22]  Vitit Kantabutra.  Motions of a short-linked robot arm in a square , 1992, Discret. Comput. Geom..

[23]  Sue Whitesides,et al.  On the Reachable Regions of Chains , 1996, CCCG.

[24]  Vitit Kantabutra.  Reaching a Point with an Unanchored Robot Arm in a Square , 1997, Int. J. Comput. Geom. Appl..

[25]  Masafumi Yamashita,et al.  Designing multi-link robot arms in a convex polygon , 1996, Int. J. Comput. Geom. Appl..

[26]  Sue Whitesides,et al.  On the Reconfiguration of Chains (Extended Abstract) , 1996, COCOON.