A note on reconfiguring tree linkages: Trees can lock

Discrete Applied Mathematics

Volumn 117, Issue 1-3, 2002, Pages 293-297

  Biedl, Therese ^a   Demaine, Erik ^a   Demaine, Martin ^a   Lazard, Sylvain ^b   Lubiw, Anna ^a   O'Rourke, Joseph ^c   Robbins, Steve ^d   Streinu, Ileana ^c   Toussaint, Godfried ^d   Whitesides, Sue ^d  

^a UNIVERSITY OF WATERLOO   (Canada)

^b INRIA   (France)

^c SMITH COLLEGE   (United States)

^d MCGILL UNIVERSITY   (Canada)

Author keywords

Distance geometry; Graph embedding; Linkage reconfiguration; Motion planning; Tree embedding

Indexed keywords

EID: 84867972776     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00229-3     Document Type: Article

References (3)

1. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, S. Robbins, I. Streinu, G. Toussaint, S. Whitesides, On reconfiguring tree linkages: Trees can lock, Technical Report SOCS-00.7, School of Computer Science, McGill University, Canada, 2000. Available from CoRR as http://arXiv.org/abs/cs/9910024/. Preliminary version presented at CCCG'98 (Canadian Conference on Computational Geometry), Montreal August 10-12, 1998.
2. R. Connelly, E.D. Demaine, G. Rote, Straightening polygonal arcs and convexifying polygonal cycles. in: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 432-442, Redondo Beach, CA, November 2000.
3. I. Streinu, A combinatorial approach to planar non-colliding robot arm motion planning. in: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 443-453, Redondo Beach, CA, November 2000.