Infinite all-layers simple foldability

DOI10.1007/s00373-019-02079-2zbMath1433.68477arXiv1901.08564OpenAlexW2980782952WikidataQ127016469 ScholiaQ127016469MaRDI QIDQ2308494

Cordelia Avery, Hugo A. Akitaya, Justin Kopinsky, Jason S. Ku, Erik D. Demaine, Joseph Bergeron

Publication date: 3 April 2020

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

Full work available at URL: https://arxiv.org/abs/1901.08564

zbMATH Keywords

NP-hardnesscomputational origamicrease patternssimple folding

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Geometric constructions in real or complex geometry (51M15)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• When can you fold a map?
• Box Pleating is Hard
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String

This page was built for publication: Infinite all-layers simple foldability