On Reconfiguring Tree Linkages: Trees can Lock
Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna, Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint,, Sue Whitesides

TL;DR
This paper demonstrates that unlike polygons, certain tree linkages in the plane cannot always be reconfigured between simple configurations, revealing exponential complexity in their configuration space.
Contribution
It proves that some trees have exponentially many disconnected configuration classes, showing fundamental differences from polygon reconfiguration.
Findings
Some trees have exponentially many disconnected configuration classes
Tree reconfiguration can be impossible while preserving simplicity
Contrast with polygon reconfiguration results
Abstract
It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex. This result cannot be extended to tree linkages: we show that there are trees with two simple configurations that are not connected by a motion that preserves simplicity throughout the motion. Indeed, we prove that an -link tree can have equivalence classes of configurations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModular Robots and Swarm Intelligence · Advanced Materials and Mechanics · Robotic Locomotion and Control
