scientific article; zbMATH DE number 1786504

zbMATH Open0990.68159MaRDI QIDQ4547796FDOQ4547796

Authors: Erik D. Demaine 

Publication date: 21 August 2002

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

Title of this publication is not available (Why is that?)

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
• scientific article; zbMATH DE number 1629824

Mathematics Subject Classification ID

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

Cited In (9)

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

This page was built for publication:

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