Abstract: Deciding flat foldability of a given mountain–valley pattern is known to be NP-complete. One special case known to be solvable in linear time is ...
This paper gives linear-time algorithms for foldability in two more-general special cases: all creases are parallel to each other and to two sides of a ...
Dec 15, 2020 · Deciding flat foldability of a given mountain-valley pattern is known to be NP-complete. One special case known to be solvable in linear ...
Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment · Erik D. DemaineM. Demaine +4 authors. Mizuho Tomura. Mathematics ...
Apr 25, 2024 · Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment. J. Inf. Process. 28: 825-833 (2020). [+] ...
In the latter zigzag case, we in fact prove that every crease pattern can be folded flat, even if each crease is specified as mountain, valley, or unfolded.
Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment. J. Inf. Process. 28: 825-833 (2020). [+][–]. Coauthor network.
Oct 22, 2024 · Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment. Article. Jan 2020. Erik D. Demaine ...
A flat fold is a crease pattern which lies flat when folded, i.e. can be pressed in a book without crumpling. Given a crease pattern C = (V,E), a mountain- ...
Missing: Parallel Nonacute Zigzag
In the latter zigzag case, we in fact prove that every crease pattern can be folded flat, even if each crease is specified as mountain, valley, or unfolded.