Rigid Origami Vertices: Conditions and Forcing SetsZachary Abel, Tomohiro Tachi, Jason Cantarella et al.|eScholarship (California Digital Library)|2015Cited by 40
Rigid origami vertices: conditions and forcing setsZachary Abel, Tomohiro Tachi, Jason Cantarella et al.|Journal of Computational Geometry (Carleton University)|2015Cited by 21
Box Pleating is HardHugo A. Akitaya, Ryuhei Uehara, Erik D. Demaine et al.|Lecture notes in computer science|2016Cited by 12
Rigid Foldability is NP-HardHugo A. Akitaya, Tomohiro Tachi, Erik D. Demaine et al.|arXiv (Cornell University)|2018Cited by 6
Rigid foldability is NP-hardHugo A. Akitaya, Tomohiro Tachi, Erik D. Demaine et al.|Journal of Computational Geometry (Carleton University)|2018Cited by 4