creators_name: Poon, Sheung-Hung
editors_name: Healy, Patrick
editors_name: Nikolov, Nikola S.
editors_id: Healy, Patrick
editors_id: Nikolov, Nikola S.
type: confposter
datestamp: 2006-03-15
lastmod: 2008-09-18 11:09:02
metadata_visibility: show
title: On Straightening Low-Diameter Unit Trees
ispublished: pub
subjects: Z.999
full_text_status: none
abstract: 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. ...
date: 2006
date_type: published
pagerange: 519-521
refereed: FALSE
referencetext: 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.

citation: Poon, Sheung-Hung (2006) On Straightening Low-Diameter Unit Trees. [Conference Poster]