Locked and unlocked polygonal chains in 3D

In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the length of each link and the simplicity of the chain are maintained throughout the movement. The analogous concept for closed chains is convexification: reconfiguration to a planar convex polygon. Chains that cannot be straightened or convexified are called locked. While there are open chains in 3D that are locked, we show that if an open chain has a simple orthogonal projection onto some plane, it can be straightened. For closed chains, we show that there are unknotted but locked closed chains, and we provide an algorithm for convexifying a planar simple polygon in 3D. All our algorithms require only O(n) basic “moves” and run in linear time.

[1]  Jason H. Cantarella,et al.  NONTRIVIAL EMBEDDINGS OF POLYGONAL INTERVALS AND UNKNOTS IN 3-SPACE , 1998 .

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

[3]  Gordon M. Crippen,et al.  Distance Geometry and Molecular Conformation , 1988 .

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

[5]  Paul Erdös,et al.  Problems for Solution: 3758-3763 , 1935 .

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

[7]  G. T. Sallee.  Stretching chords of space curves , 1973 .

[8]  C. Gibson,et al.  On the geometry of the planar 4-bar mechanism , 1986 .

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

[10]  Francis Y. L. Chin,et al.  Finding the Medial Axis of a Simple Polygon in Linear Time , 1995, ISAAC.

[11]  K. H. Hunt,et al.  Kinematic geometry of mechanisms , 1978 .

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

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

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

[15]  Godfried T. Toussaint.  The Erdös-Nagy theorem and its ramifications , 1999, CCCG.

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

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

[18]  G. Toussaint.  The Erd} Os-nagy Theorem and Its Ramiications , 1999 .

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

[20]  G. Budworth.  The Knot Book , 1983 .

[21]  Prosenjit Bose,et al.  Drawing Nice Projections of Objects in Space , 1999, J. Vis. Commun. Image Represent..