Origami, Linkages, and Polyhedra: Folding with Algorithms

DOI10.1007/11841036_1zbMATH Open1131.68564OpenAlexW2120724421MaRDI QIDQ5449509

Erik D. Demaine

Publication date: 11 March 2008

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

Full work available at URL: https://doi.org/10.1007/11841036_1

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

An algorithmic study of manufacturing paperclips and other folded structures. ⋮ Title not available (Why is that?) ⋮ An introduction to computational origami ⋮ An Algorithm for Finding the Veech Group of an Origami ⋮ Origami fold as algebraic graph rewriting ⋮ Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami ⋮ Rigid Origami Vertices: Conditions and Forcing Sets

This page was built for publication: Origami, Linkages, and Polyhedra: Folding with Algorithms

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