Rectangular Unfoldings of Polycubes. | 0 | 0.34 | 2019 |
Infinite All-Layers Simple Foldability. | 0 | 0.34 | 2019 |
Rigid Foldability Is Np-Hard | 0 | 0.34 | 2018 |
Computing 3SAT on a Fold-and-Cut Machine. | 0 | 0.34 | 2017 |
Simple Folding is Really Hard. | 1 | 0.40 | 2017 |
Folded Structures Satisfying Multiple Conditions. | 0 | 0.34 | 2017 |
Symmetric assembly puzzles are hard, beyond a few pieces | 0 | 0.34 | 2017 |
Folding Flat Crease Patterns with Thick Materials. | 4 | 0.47 | 2016 |
Rigid Origami Vertices: Conditions And Forcing Sets | 3 | 0.47 | 2016 |
Landmark mapping from unbiased observations | 2 | 0.48 | 2015 |
Filling a Hole in a Crease Pattern: Isometric Mapping from Prescribed Boundary Folding. | 1 | 0.41 | 2014 |