{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:55:07Z","timestamp":1742990107003,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_22","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"277-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithm for Box Folding"],"prefix":"10.1007","author":[{"given":"Koichi","family":"Mizunashi","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Horiyama","sequence":"additional","affiliation":[]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Abel, Z.R., Demaine, E.D., Demaine, M.L., Ito, H., Snoeyink, J., Uehara, R.: Bumpy Pyramid Folding. Computational Geometry: Theory and Applications (2018, accepted). https:\/\/doi.org\/10.1016\/j.comgeo.2018.06.007","DOI":"10.1016\/j.comgeo.2018.06.007"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Akiyama, J.: Tile-Makers and Semi-Tile-Makers. The Mathematical Association of Amerika, Monthly 114, pp. 602\u2013609, August\u2013September 2007","DOI":"10.1080\/00029890.2007.11920450"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.22342\/jims.13.1.77.99-114","volume":"13","author":"J Akiyama","year":"2007","unstructured":"Akiyama, J., Nara, C.: Developments of polyhedra using oblique coordinates. J. Indonesia. Math. Soc. 13(1), 99\u2013114 (2007)","journal-title":"J. Indonesia. Math. Soc."},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"447","DOI":"10.5802\/aif.2358","volume":"58","author":"AI Bobenko","year":"2008","unstructured":"Bobenko, A.I., Izmestiev, I.: Alexandrov\u2019s theorem, weighted Delaunay triangulations, and mixed volumes. Annales de l\u2019Institut Fourier 58(2), 447\u2013505 (2008)","journal-title":"Annales de l\u2019Institut Fourier"},{"key":"22_CR5","unstructured":"Buchin, K., et al.: On rolling cube puzzles. In: 19th Canadian Conference on Computational Geometry (CCCG 2007), pp. 141\u2013144 (2007)"},{"key":"22_CR6","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, New York (2007)"},{"key":"22_CR7","unstructured":"D\u00fcrer, A.: Underweysung der messung, mit den zirckel un richtscheyt, in Linien ebnen unnd gantzen corporen (1525)"},{"key":"22_CR8","unstructured":"Horiyama, T., Mizunashi, K.: Folding orthogonal polygons into rectangular boxes. In: Proceedings of the 19th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2016) (2016)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-03367-4_38","volume-title":"Algorithms and Data Structures","author":"D Kane","year":"2009","unstructured":"Kane, D., Price, G.N., Demaine, E.D.: A pseudopolynomial algorithm for Alexandrov\u2019s theorem. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 435\u2013446. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03367-4_38"},{"key":"22_CR10","unstructured":"Mitani, J., Uehara, R.: Polygons folding to plural incongruent orthogonal boxes. In: Canadian Conference on Computational Geometry (CCCG 2008), pp. 39\u201342 (2008)"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1142\/S0218195913500040","volume":"23","author":"T Shirakawa","year":"2013","unstructured":"Shirakawa, T., Uehara, R.: Common developments of three incongruent orthogonal boxes. Int. J. Comput. Geom. Appl. 23(1), 65\u201371 (2013)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"22_CR12","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. Theory Appl. 64, 1\u201317 (2017)","journal-title":"Comput. Geom. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:51:42Z","timestamp":1709823102000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}