scientific article; zbMATH DE number 1830752

MaRDI QIDQ4778574zbMATH OpenFDO

Authors Esther M. Arkin, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Michael A. Bender

Publication date 18 November 2002

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

zbMATH Keywords

origami

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• When can you fold a map?
• When can a net fold to a polyhedron?
• scientific article; zbMATH DE number 871913
• Flat-foldability for \(1 \times n\) maps with square/diagonal grid patterns
• Infinite all-layers simple foldability

Cited in

(19)

• Modelling the folding of paper into three dimensions using affine transformations
• An algorithmic study of manufacturing paperclips and other folded structures.
• When can you fold a map?
• Infinite all-layers simple foldability
• When can a net fold to a polyhedron?
• Box pleating is hard
• Making polygons by simple folds and one straight cut
• Folding triangular and hexagonal mazes
• Folding a better checkerboard
• scientific article; zbMATH DE number 1305504 (Why is no real title available?)
• scientific article; zbMATH DE number 1507294 (Why is no real title available?)
• Origamizer: a practical algorithm for folding any polyhedron
• scientific article; zbMATH DE number 871913 (Why is no real title available?)
• Rigid foldability is NP-hard
• Flat-foldability for \(1 \times n\) maps with square/diagonal grid patterns
• The carpenter's ruler folding problem
• Complexity of simple folding of mixed orthogonal crease patterns
• Orthogonal fold \& cut
• Clarifying the difference between origami fold models by a matrix representation

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 Q4778574)