731 1 archive 2 disk0/00/00/07/31 2006-03-15 2008-09-18 11:09:02 2008-09-18 11:09:02 confposter show 0 A polygonal chain is a sequence of consecutively joined edges embedded in space. A k-chain is a chain of k edges. A polygonal tree is a set of edges joined into a tree structure embedded in space. A unit tree is a tree with only edges of unit lenght. A chain or a tree is simple if non-adjacent edges do not intersect. ... http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3843&spage=519 Poon Sheung-Hung September 12-14, 2005 Graph Drawing Limerick, Ireland Healy Patrick Healy, Patrick Nikolov Nikola S. Nikolov, Nikola S. pub 519-521 FALSE FALSE 1. H. Alt, C. 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: Tree 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 Comp. Sci. (FOCS), 443-453, 2000. Z.999 published 2006 none