{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:46:17Z","timestamp":1740109577266,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"JSPS","award":["JP17H06287","JP18H04091"],"award-info":[{"award-number":["JP17H06287","JP18H04091"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00454-022-00415-7","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T14:04:07Z","timestamp":1658498647000},"page":"1499-1522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Folding Algorithms for Convex Polyhedra"],"prefix":"10.1007","volume":"70","author":[{"given":"Tonan","family":"Kamata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Kadoguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Horiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0895-3765","authenticated-orcid":false,"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"issue":"7","key":"415_CR1","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1080\/00029890.2007.11920450","volume":"114","author":"J Akiyama","year":"2007","unstructured":"Akiyama, J.: Tile-makers and semi-tile-makers. Am. Math. Mon. 114(7), 602\u2013609 (2007)","journal-title":"Am. Math. Mon."},{"key":"415_CR2","first-page":"750","volume":"28","author":"J Akiyama","year":"2020","unstructured":"Akiyama, J., Matsunaga, K.: An algorithm for folding a Conway tile into an isotetrahedron or a rectangle dihedron. J. Inf. Process. 28, 750\u2013758 (2020)","journal-title":"J. Inf. Process."},{"key":"415_CR3","volume-title":"Modern Pure Solid Geometry","author":"N Altshiller-Court","year":"1979","unstructured":"Altshiller-Court, N.: Modern Pure Solid Geometry. Chelsea, New York (1979)"},{"key":"415_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2008)"},{"key":"415_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511735172","volume-title":"Geometric Folding Algorithms: Linkages, Origami, Polyhedra","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, Cambridge (2007)"},{"key":"415_CR6","unstructured":"D\u00fcrer, A.: Underweysung der Messung, mit den Zirckel un Richtscheyt. In: Linien ebnen unnd gantzen Corporen. N\u00fcremberg (1525)"},{"key":"415_CR7","unstructured":"Horiyama, T., Mizunashi, K.: Folding orthogonal polygons into rectangular boxes. In: 19th Japan-Korea Joint Workshop on Algorithms and Computation (Hakodate 2016)"},{"key":"415_CR8","unstructured":"Kamata, T., Kadoguchi, A., Horiyama, T., Uehara, R.: Efficient folding algorithms for regular polyhedra. In: 32nd Canadian Conference on Computational Geometry, pp. 131\u2013137 (2020)"},{"key":"415_CR9","doi-asserted-by":"crossref","unstructured":"Kamata, T., Kadoguchi, A., Horiyama, T., Uehara, R.: Efficient folding algorithms for regular polyhedra (2021). arXiv:2105.14305","DOI":"10.1007\/s00454-022-00415-7"},{"key":"415_CR10","unstructured":"Mitani, J., Uehara, R.: Polygons folding to plural incongruent orthogonal boxes. In: 20th Canadian Conference on Computational Geometry (Montreal 2008), pp. 31\u201334 (2008)"},{"issue":"2","key":"415_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.7155\/jgaa.00520","volume":"24","author":"K Mizunashi","year":"2020","unstructured":"Mizunashi, K., Horiyama, T., Uehara, R.: Efficient algorithm for box folding. J. Graph Algorithms Appl. 24(2), 89\u2013103 (2020)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"415_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1080\/0025570X.1980.11976859","volume":"53","author":"D Schattschneider","year":"1980","unstructured":"Schattschneider, D.: Will it tile? Try the Conway criterion! Math. Mag. 53(4), 224\u2013233 (1980)","journal-title":"Math. Mag."},{"key":"415_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2017.03.001","volume":"64","author":"D Xu","year":"2017","unstructured":"Xu, D., Horiyama, T., Shirakawa, T., Uehara, R.: Common developments of three incongruent boxes of area 30. Comput. Geom. 64, 1\u201317 (2017)","journal-title":"Comput. Geom."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-022-00415-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-022-00415-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-022-00415-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T23:02:51Z","timestamp":1700953371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-022-00415-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,22]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["415"],"URL":"https:\/\/doi.org\/10.1007\/s00454-022-00415-7","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2022,7,22]]},"assertion":[{"value":"16 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}