{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:06Z","timestamp":1750306746006,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,21]],"date-time":"2013-07-21T00:00:00Z","timestamp":1374364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7,21]]},"DOI":"10.1145\/2503385.2503407","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"1-1","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Generating folding sequences from crease patterns of flat-foldable origami"],"prefix":"10.1145","author":[{"given":"Hugo A.","family":"Akitaya","sequence":"first","affiliation":[{"name":"University of Tsukuba"}]},{"given":"Jun","family":"Mitani","sequence":"additional","affiliation":[{"name":"University of Tsukuba\/JST ERATO"}]},{"given":"Yoshihiro","family":"Kanamori","sequence":"additional","affiliation":[{"name":"University of Tsukuba"}]},{"given":"Yukio","family":"Fukui","sequence":"additional","affiliation":[{"name":"University of Tsukuba"}]}],"member":"320","published-online":{"date-parts":[[2013,7,21]]},"reference":[{"volume-title":"Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics","author":"Bern M.","key":"e_1_3_2_2_1_1","unstructured":"Bern , M. , and Hayes , B . 1996. The complexity of flat origami . In Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics , Philadelphia, PA, USA, SODA '96, 175--183. Bern, M., and Hayes, B. 1996. The complexity of flat origami. In Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, SODA '96, 175--183."},{"volume-title":"Origami Design Secrets: Mathematical Methods for an Ancient Art","author":"Lang R. J.","key":"e_1_3_2_2_2_1","unstructured":"Lang , R. J. 2012. Origami Design Secrets: Mathematical Methods for an Ancient Art . Second Edition. CRC Press . Lang, R. J. 2012. Origami Design Secrets: Mathematical Methods for an Ancient Art. Second Edition. CRC Press."},{"key":"e_1_3_2_2_3_1","first-page":"9","article-title":"Development of origami pattern editor (ORIPA) and a method for estimating a folded configuration of origami from the crease pattern","volume":"48","author":"Mitani J.","year":"2007","unstructured":"Mitani , J. 2007 . Development of origami pattern editor (ORIPA) and a method for estimating a folded configuration of origami from the crease pattern . IPSJ Journal 48 , 9 (sep), 3309--3317. Mitani, J. 2007. Development of origami pattern editor (ORIPA) and a method for estimating a folded configuration of origami from the crease pattern. IPSJ Journal 48, 9 (sep), 3309--3317.","journal-title":"IPSJ Journal"}],"event":{"name":"SIGGRAPH '13: Special Interest Group on Computer Graphics and Interactive Techniques Conference","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"Anaheim California","acronym":"SIGGRAPH '13"},"container-title":["ACM SIGGRAPH 2013 Posters"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503385.2503407","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2503385.2503407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:22Z","timestamp":1750231702000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503385.2503407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,21]]},"references-count":3,"alternative-id":["10.1145\/2503385.2503407","10.1145\/2503385"],"URL":"https:\/\/doi.org\/10.1145\/2503385.2503407","relation":{},"subject":[],"published":{"date-parts":[[2013,7,21]]},"assertion":[{"value":"2013-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}