A note on reconfiguring tree linkages: Trees can lock

DOI10.1016/S0166-218X(01)00229-3MaRDI QIDQ1348403zbMATH OpenOpenAlexFDO

Authors Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Godfried Toussaint, Sue Whitesides

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

zbMATH Keywords

graph embeddingmotion planningtree embeddingdistance geometrylinkage reconfiguration

Mathematics Subject Classification ID

Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Recommendations

• scientific article; zbMATH DE number 2145225
• Polygonal chains cannot lock in 4D
• The complexity of (un)folding
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• Graph Drawing

Cites work

• A note on reconfiguring tree linkages: Trees can lock
• Straightening polygonal arcs and convexifying polygonal cycles

Cited in

(14)

• The complexity of (un)folding
• Locked and unlocked smooth embeddings of surfaces
• An algorithmic study of manufacturing paperclips and other folded structures.
• Graph Drawing
• Minimal Locked Trees
• On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
• scientific article; zbMATH DE number 1877249 (Why is no real title available?)
• Morphing polyhedra with parallel faces: Counterexamples
• A note on reconfiguring tree linkages: Trees can lock
• ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES
• On reconfiguring radial trees
• Folding equilateral plane graphs
• Polygonal chains cannot lock in 4D
• scientific article; zbMATH DE number 2145225 (Why is no real title available?)

This page was built for publication: A note on reconfiguring tree linkages: Trees can lock

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348403)