T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw et al., Locked and unlocked polygonal chains in 3D. Manuscript in preparation, 1999. A preliminary version, Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pp.866-867, 1999.

T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw et al., Godfried Toussaint, and Sue Whitesides. On reconnguring tree linkages: Trees can lock, Proc. 10th Canadian Conf. Comput. Geom., Montr eal, 1998.

R. Cocan and J. Rourke, Polygonal chains cannot lock in 4D, Proc. 11th Canadian Conf, 1999.
DOI : 10.1016/S0925-7721(01)00013-X

H. Everett, S. Lazard, S. Robbins, H. Schrr, and S. Whitesides, Convexifying star-shaped polygons, Proc. 10th Canadian Conf. Comput. Geom., Montr eal, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00442788

W. J. Lenhart and S. H. Whitesides, Reconfiguring closed polygonal chains in Euclideand-space, Discrete & Computational Geometry, vol.24, issue.2, pp.123-140, 1995.
DOI : 10.1007/BF02574031

O. Joseph and . Rourke, Folding and unfolding in computational geometry, Proc

J. Conf, Discrete and Computational Geometry, 1998.

G. Toussaint, The Erd} os-Nagy theorem and its ramiications, Proc. 11th Canadian Conf, 1999.

S. Whitesides, Algorithmic issues in the geometry of planar linkage movement, Australian Computer Journal, vol.24, issue.2, pp.42-50, 1992.