Jun 1, 2023 · We give new efficient algorithms for mixed crease patterns, where some creases are assigned mountain/valley while others are unassigned, for all ...
Jun 1, 2023 · Abstract. Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem — deciding which ...
We give new efficient algorithms for mixed crease patterns, where some creases ... Complexity of Simple Folding Orthogonal Crease Patterns. TJCDCGGG2021.
We give new efficient algorithms for mixed crease patterns, where some creases are assigned mountain/valley while others are unassigned, for all 1D cases and ...
Complexity of Simple Folding of Mixed Orthogonal Crease Patterns · H. Akitaya ... crease patterns (where each crease can fold… Expand. arXiv (opens in a ...
We prove strong NP-completeness of deciding whether a crease pattern can be simply folded, both for orthogonal paper with assigned orthogonal creases and for ...
Jul 22, 2024 · Isolating them and having them next to your full model that you are folding will really help you a ton. It's really a lot of additional work, ...
Missing: Mixed Orthogonal
4 (2023): December - Articles Complexity of Simple Folding of Mixed Orthogonal Crease Patterns Abstract PDF · Thai Journal of Mathematics Vol. 21 No. 4 (2023): ...
Complexity of Simple Folding of Mixed Orthogonal Crease Patterns ... TL;DR: For the simple foldability problem, the authors showed strong NP-completeness for ...