论文信息 - A Locked Orthogonal Tree

A Locked Orthogonal Tree

We give a counterexample to a conjecture of Poon [Poo06] that any orthogonal tree in two dimensions can always be flattened by a continuous motion that preserves edge lengths and avoids self-intersection. We show our example is locked by extending results on strongly locked self-touching linkages due to Connelly, Demaine and Rote [CDR02] to allow zero-length edges as defined in [ADG07], which may be of independent interest. Our results also yield a locked tree with only eleven edges, which is the smallest known example of a locked tree.

[1] Sheung-Hung Poon. On Unfolding Lattice Polygons/Trees and Diameter-4 Trees , 2009, Int. J. Comput. Geom. Appl..

[2] R. Connelly,et al. Innitesimally Locked Self-Touching Linkages with Applications to Locked Trees , 2002 .

[3] Erik D. Demaine,et al. A note on reconfiguring tree linkages: trees can lock , 2002, Discrete Applied Mathematics.

[4] Erik D. Demaine,et al. A Generalized Carpenter's Rule Theorem for Self-Touching Linkages , 2009, ArXiv.

[5] Günter Rote,et al. Straightening polygonal arcs and convexifying polygonal cycles , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6] Sheung-Hung Poon,et al. On Straightening Low-Diameter Unit Trees , 2005, GD.

[7] Joseph S. B. Mitchell,et al. Locked and unlocked chains of planar shapes , 2006, SCG '06.