A note on reconfiguring tree linkages: Trees can lock
From MaRDI portal
Publication:1348403
DOI10.1016/S0166-218X(01)00229-3zbMath0993.52003OpenAlexW2046372295MaRDI QIDQ1348403
Steve Robbins, Joseph O'Rourke, Sylvain Lazard, Anna Lubiw, Ileana Streinu, Therese C. Biedl, S. H. Whitesides, Martin L. Demaine, Godfried T. Toussaint, Erik D. Demaine
Publication date: 15 May 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00229-3
Related Items (8)
An algorithmic study of manufacturing paperclips and other folded structures. ⋮ A note on reconfiguring tree linkages: Trees can lock ⋮ FOLDING EQUILATERAL PLANE GRAPHS ⋮ Minimal Locked Trees ⋮ ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES ⋮ On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees ⋮ Unnamed Item ⋮ Morphing polyhedra with parallel faces: Counterexamples
Cites Work
This page was built for publication: A note on reconfiguring tree linkages: Trees can lock
