Paper by Erik D. Demaine
- Brad Ballinger, David Charlton, Erik D. Demaine, Martin L. Demaine, John Iacono, Ching-Hao Liu, and Sheung-Hung Poon, “Minimal Locked Trees”, in Proceedings of the 11th Algorithms and Data Structures Symposium (WADS 2009), Lecture Notes in Computer Science, volume 5664, Banff, Alberta, Canada, August 21–23, 2009, pages 61–73.
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).
- This paper is also available from SpringerLink.
- Copyright held by the authors.
- The paper is 12 pages.
- The paper is available in PostScript (3995k), gzipped PostScript (1654k), and PDF (359k).
- See information on file formats.
- [Google Scholar search]
See also other papers by Erik Demaine.
These pages are generated automagically from a
Last updated January 8, 2018 by