Linkages (II) - Old Wine in New Bottles
Many recent preprints related to the material treated in this column and related topics can be found here. These references complement those which accompanied the first article in this series. In addition, here are a few additional references.
Pei, N. and S. Whitesides, On the reachable regions of chains, Proc. 8th Canadian Conf. on Computational Geometry, Carleton U., Ottawa, 1996, p. 161-166.
Pei,, N. and S. Whitesides, On folding rulers in regular polygons, Proc. 9th Canadian Conf. on Computational Geometry, Queens U., Kingston, 1997, 11-16.
Sharir, M., Algorithmic motion planning, in Handbook of Discrete and Computational Geometry, Chapter 40, J. Goodman and J. O'Rourke, (eds.), CRC Press, Boca Raton, 1997, p. 733-754.
Whitesides, S. Chain reconfiguration: the ins and outs, ups and downs of moving polygons and polygonal linkages, (to appear in Lecture Notes in Computer Science, Springer-Verlag).
Whitesides, S. and N. Pei, On the reconfiguration of chains, in Computing and Combinatorics, J. Cai and C. Wong, (eds.), Lecture Notes in Computer Science, Volume 1090, Springer-Verlag, New York, 1996, 381-390.
- Chain and polygonal linkages
- Further steps
- Folding rulers