Rigid origami vertices: conditions and forcing sets
We develop an intrinsic necessary and sufficient condition for single-vertex origami crease patterns to be able to fold rigidly. We classify such patterns in the case where the creases are pre-assigned to be mountains and valleys as well as in the unassigned case. We also illustrate the utility of...
Main Authors: | Zachary Abel, Jason Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi |
---|---|
Format: | Article |
Language: | English |
Published: |
Carleton University
2016-04-01
|
Series: | Journal of Computational Geometry |
Online Access: | http://jocg.org/index.php/jocg/article/view/251 |
Similar Items
-
Rigid foldability is NP-hard
by: Demaine, Erik D, et al.
Published: (2020) -
Origami tomography
by: Ku, Jason (Jason Stoutsenberger)
Published: (2012) -
Circle Packing for Origami Design Is Hard
by: Demaine, Erik D, et al.
Published: (2019) -
Origamizer: A practical algorithm for folding any polyhedron
by: Demaine, Erik, et al.
Published: (2021) -
Origamizer: A practical algorithm for folding any polyhedron
by: Demaine, Erik, et al.
Published: (2021)