A note on reconfiguring tree linkages: Trees can lock
From MaRDI portal
(Redirected from Publication:1348403)
Recommendations
Cites work
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)