On straightening low-diameter unit trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3843 LNCS, Issue , 2006, Pages 519-521

  Poon, Sheung Hung ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745653172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_51     Document Type: Conference Paper

References (5)

1. H. Alt, G. Knauer, G. Rote, and S. Whitesides. The Complexity of (Un)folding. Proc. 19th ACM Symp. on Comput, Geom. (SOCG), 164-170, 2003.
2. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides. A Note on Reconfiguring Tree Linkages: Trees can Lock. Disc. Appl. Math., 117:1-3, 293-297, 2002.
3. R. Cocan and J. O'Rourke. Polygonal Chains Cannot Lock in 4D. Comput. Geom.: Theory & Appl., 20, 105-129, 2001.
4. R. Connelly, E.D. Demaine, and G. Rote. Straightening Polygonal Arcs and Convexifying Polygonal Cycles. Disc. & Comput. Geom., 30:2, 205-239, 2003.
5. I. Streinu. A combinatorial approach for planar non-colliding robot arm motion planning. Proc. 41st ACM Symp. on Found, of Camp. Sci. (FOCS), 443-453, 2000.