Minimal Locked Trees
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties needed for planar trees to lock, with a focus on finding the smallest locked trees according to different measures of complexity, and suggests some new avenues of research for the problem of algorithmic characterization. First we present a locked linear tree with only eight edges. In contrast, the smallest previous locked tree has 15 edges. We further show minimality by proving that every locked linear tree has at least eight edges. We also show that a six-edge tree can interlock with a four-edge chain, which is the first locking result for individually unlocked trees. Next we present several new examples of locked trees with varying minimality results. Finally, we provide counterexamples to two conjectures of ,  by showing the existence of two new types of locked tree: a locked orthogonal tree (all edges horizontal and vertical) and a locked equilateral tree (all edges unit length).
KeywordsComputational Geometry Positive Time Linear Tree Leaf Vertex Tree Linkage
Unable to display preview. Download preview PDF.
- 1.Abbott, T.G., Demaine, E.D., Gassend, B.: A generalized carpenter’s rule theorem for self-touching linkages (preprint) (December 2007)Google Scholar
- 2.Alt, H., Knauer, C., Rote, G., Whitesides, S.: On the complexity of the linkage reconfiguration problem. In: Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol. 342, pp. 1–14. AMS (2004)Google Scholar
- 3.Biedl, T., Demaine, E.D., Demaine, M.L., Lazard, S., Lubiw, A., O’Rourke, J., Robbins, S., Streinu, I., Toussaint, G., Whitesides, S.: A note on reconfiguring tree linkages: Trees can lock. Discrete Applied Mathematics 117(1–3), 293–297 (2002); The full paper is Technical Report SOCS-00.7, School of Computer Science, McGill University (September 2000) (Originally appeared at CCCG 1998)MathSciNetCrossRefzbMATHGoogle Scholar
- 4.Connelly, R., Demaine, E.D., Demaine, M.L., Fekete, S., Langerman, S., Mitchell, J.S.B., Ribó, A., Rote, G.: Locked and unlocked chains of planar shapes. In: Proceedings of the 22nd Annual ACM Symposium on Computational Geometry, Sedona, Arizona, June 2006, pp. 61–70 (2006)Google Scholar
- 5.Connelly, R., Demaine, E.D., Rote, G.: Infinitesimally locked self-touching linkages with applications to locked trees. In: Physical Knots: Knotting, Linking, and Folding of Geometric Objects in \(\mathbb R^3\), pp. 287–311. AMS (2002)Google Scholar
- 8.Demaine, E.D., Demaine, M.L.: Computing extreme origami bases. Technical Report CS-97-22, Dept. of Computer Science, University of Waterloo (May 1997)Google Scholar
- 9.Demaine, E.D., Langerman, S., O’Rourke, J., Snoeyink, J.: Interlocked open linkages with few joints. In: Proceedings of the 18th Annual ACM Symposium on Computational Geometry, Barcelona, Spain, June 2002, pp. 189–198 (2002)Google Scholar
- 13.Poon, S.-H.: On unfolding lattice polygons/trees and diameter-4 trees. In: Proceedings of the 12th Annual International Computing and Combinatorics Conference, pp. 186–195 (2006)Google Scholar