{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:12:51Z","timestamp":1763017971050,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140847"},{"type":"electronic","value":"9783030140854"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14085-4_36","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"457-468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Unfolding Level 1 Menger Polycubes of Arbitrary Size With Help of Outer Faces"],"prefix":"10.1007","author":[{"given":"Lydie","family":"Richaume","sequence":"first","affiliation":[]},{"given":"Eric","family":"Andres","sequence":"additional","affiliation":[]},{"given":"Ga\u00eblle","family":"Largeteau-Skapin","sequence":"additional","affiliation":[]},{"given":"Rita","family":"Zrour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-24983-9_5","volume-title":"Computational Geometry, Graphs and Applications","author":"G Aloupis","year":"2011","unstructured":"Aloupis, G., et al.: Common unfoldings of polyominoes and polycubes. In: Akiyama, J., Bo, J., Kano, M., Tan, X. (eds.) CGGA 2010. LNCS, vol. 7033, pp. 44\u201354. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24983-9_5"},{"unstructured":"Biedl, T., et al.: Unfolding some classes of orthogonal polyhedra. In: Proceedings of 10th Canadian Conference on Computer Geometry, January 1998","key":"36_CR2"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-662-48971-0_36","volume-title":"Algorithms and Computation","author":"Y-J Chang","year":"2015","unstructured":"Chang, Y.-J., Yen, H.-C.: Unfolding orthogonal polyhedra with linear refinement. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 415\u2013425. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_36"},{"issue":"01n02","key":"36_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1142\/S0218195917600032","volume":"27","author":"Y-J Chang","year":"2017","unstructured":"Chang, Y.-J., Yen, H.-C.: Improved algorithms for grid-unfolding orthogonal polyhedra. Int. J. Comput. Geom. Appl. 27(01n02), 33\u201356 (2017)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"5","key":"36_CR5","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1007\/s00373-017-1849-5","volume":"33","author":"M Damian","year":"2017","unstructured":"Damian, M., Demaine, E., Flatland, R., O\u2019Rourke, J.: Unfolding genus-2 orthogonal polyhedra with linear refinement. Graphs and Combinatorics 33(5), 1357\u20131379 (2017)","journal-title":"Graphs and Combinatorics"},{"unstructured":"Damian, M., Flatland, R., Meijer, H., O\u2019rourke, J.: Unfolding well-separated orthotrees. In: 15th Annual Fall Workshop Computer Geometry, pp. 23\u201325. Citeseer (2005)","key":"36_CR6"},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.comgeo.2007.07.003","volume":"40","author":"M Damian","year":"2008","unstructured":"Damian, M., Flatland, R., O\u2019Rourke, J.: Unfolding manhattan towers. Comput. Geom. 40(2), 102\u2013114 (2008)","journal-title":"Comput. Geom."},{"key":"36_CR8","first-page":"167","volume":"52","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., O\u2019Rourke, J.: A survey of folding and unfolding in computational geometry. Combinatorial Comput. Geom. 52, 167\u2013211 (2005)","journal-title":"Combinatorial Comput. Geom."},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-62389-4_23","volume-title":"Computing and Combinatorics","author":"K-Y Ho","year":"2017","unstructured":"Ho, K.-Y., Chang, Y.-J., Yen, H.-C.: Unfolding some classes of orthogonal polyhedra of arbitrary genus. In: Cao, Y., Chen, J. (eds.) COCOON 2017. LNCS, vol. 10392, pp. 275\u2013286. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62389-4_23"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-08783-2_22","volume-title":"Computing and Combinatorics","author":"M-H Liou","year":"2014","unstructured":"Liou, M.-H., Poon, S.-H., Wei, Y.-J.: On edge-unfolding one-layer lattice polyhedra with cubic holes. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds.) COCOON 2014. LNCS, vol. 8591, pp. 251\u2013262. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08783-2_22"},{"key":"36_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-16056-4","volume-title":"Dimensionstheorie","author":"K Menger","year":"1928","unstructured":"Menger, K.: Dimensionstheorie. Springer, Heidelberg (1928). https:\/\/doi.org\/10.1007\/978-3-663-16056-4"},{"issue":"3","key":"36_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/1015706.1015711","volume":"23","author":"J Mitani","year":"2004","unstructured":"Mitani, J., Suzuki, H.: Making papercraft toys from meshes using strip-based approximate unfolding. ACM Trans. Graph. (TOG) 23(3), 259\u2013263 (2004)","journal-title":"ACM Trans. Graph. (TOG)"},{"unstructured":"O\u2019Rourke, J.: Unfolding orthogonal terrains. arXiv preprint arXiv:0707.0610 (2007)","key":"36_CR13"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-46515-7_22","volume-title":"Discrete and Computational Geometry","author":"J O\u2019Rourke","year":"2000","unstructured":"O\u2019Rourke, J.: Folding and unfolding in computational geometry. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 258\u2013266. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46515-7_22"},{"unstructured":"Richaume, L., Andres, E., Largeteau-Skapin, G., Zrour, R.: Unfolding H-convex Manhattan Towers. HAL preprint, December 2018. https:\/\/hal.archives-ouvertes.fr\/hal-01963257","key":"36_CR15"},{"doi-asserted-by":"crossref","unstructured":"Wang, C.-H.: Manufacturability-driven decomposition of sheet metal products. Ph.D. thesis, Carnegie Mellon University (1997)","key":"36_CR16","DOI":"10.1115\/DETC97\/DFM-4328"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14085-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:10:10Z","timestamp":1679188210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry for Computer Imagery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgci2019.sciencesconf.org\/","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":"50","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":"38","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":"76% - 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":"1-2","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}