On Straightening Low-Diameter Unit Trees

  • Sheung-Hung Poon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3843)


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 length. A chain or a tree is simple if non-adjacent edges do not intersect.

We consider the problem about the reconfiguration of a simple chain or tree through a series of continuous motions such that the lengths of all tree edges are preserved and no edge crossings are allowed. A chain or tree can be straightened if all its edges can be aligned along a common straight line such that each edge points “away” from a designed leaf node. Otherwise it is called locked. Graph reconfiguration problems have wide applications in contexts including robotics, molecular conformation, rigidity and knot theory. The motivation for us to study unit trees is that for instance, the bonding-lengths in molecules are often similar, as are the segments of robot arms.


Unit Tree Edge Point Tree Edge Edge Crossing Simple Chain 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sheung-Hung Poon
    • 1
  1. 1.Department of Mathematics and Computer ScienceTU EindhovenEindhovenThe Netherlands

Personalised recommendations