Folding and unfolding linkages, paper, and polyhedra

DOI10.1007/3-540-47738-1_9MaRDI QIDQ4547796zbMATH OpenFDO

Authors Erik D. Demaine

Publication date 21 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2098/20980113

Mathematics Subject Classification ID

Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Origami, Linkages, and Polyhedra: Folding with Algorithms
• Geometric folding algorithms. Linkages, origami, polyhedra
• How to fold it. The mathematics of linkages, origami and polyhedra
• A survey of folding and unfolding in computational geometry
• Folding and unfolding in computational geometry

Cited in

(9)

• An algorithmic study of manufacturing paperclips and other folded structures.
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• scientific article; zbMATH DE number 7498814 (Why is no real title available?)
• A Note on "Impossible" Paper Folding
• Unfolding simple folds from crease patterns
• A survey of folding and unfolding in computational geometry
• The complexity of (un)folding
• Geometric folding algorithms. Linkages, origami, polyhedra
• Origami, Linkages, and Polyhedra: Folding with Algorithms

This page was built for publication: Folding and unfolding linkages, paper, and polyhedra

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