Abstract
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 [12], [13] 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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abbott, T.G., Demaine, E.D., Gassend, B.: A generalized carpenter’s rule theorem for self-touching linkages (preprint) (December 2007)
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)
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)
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)
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)
Connelly, R., Demaine, E.D., Rote, G.: Straightening polygonal arcs and convexifying polygonal cycles. Discrete & Computational Geometry 30(2), 205–239 (2003)
Dawson, R.: On removing a ball without disturbing the others. Mathematics Magazine 57(1), 27–30 (1984)
Demaine, E.D., Demaine, M.L.: Computing extreme origami bases. Technical Report CS-97-22, Dept. of Computer Science, University of Waterloo (May 1997)
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)
Demaine, E.D., Langerman, S., O’Rourke, J., Snoeyink, J.: Interlocked open and closed linkages with few joints. Computational Geometry: Theory and Applications 26(1), 37–45 (2003)
Glass, J., Lu, B., O’Rourke, J., Zhong, J.K.: A 2-chain can interlock with an open 11-chain. Geombinatorics 15(4), 166–176 (2006)
Poon, S.-H.: On straightening low-diameter unit trees. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 519–521. Springer, Heidelberg (2006)
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)
Streinu, I.: Pseudo-triangulations, rigidity and motion planning. Discrete & Computational Geometry 34(4), 587–635 (2005)
Toussaint, G.T.: Movable separability of sets. In: Computational Geometry, pp. 335–375. North-Holland, Amsterdam (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ballinger, B. et al. (2009). Minimal Locked Trees. In: Dehne, F., Gavrilova, M., Sack, JR., Tóth , C.D. (eds) Algorithms and Data Structures. WADS 2009. Lecture Notes in Computer Science, vol 5664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03367-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-03367-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03366-7
Online ISBN: 978-3-642-03367-4
eBook Packages: Computer ScienceComputer Science (R0)