Algorithmic folding complexity

DOI10.1007/s00373-011-1019-0zbMath1234.68131OpenAlexW2783369107MaRDI QIDQ659709

Erik D. Demaine, Stefan Langerman, Ryuhei Uehara, Takeaki Uno, Jean Cardinal, Martin L. Demaine, Masashi Kiyomi, Shinji Imahori, Tsuyoshi Ito

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1019-0

zbMATH Keywords

foldingalgorithm designmountain-valley patternsOrigami

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Combinatorics on words (68R15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• When can you fold a map?
• Algorithmic Folding Complexity
• Arithmetic and analytic properties of paper folding sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding

This page was built for publication: Algorithmic folding complexity