{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:55:38Z","timestamp":1648781738487},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,17]],"date-time":"2011-03-17T00:00:00Z","timestamp":1300320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s00373-011-1024-3","type":"journal-article","created":{"date-parts":[[2011,3,16]],"date-time":"2011-03-16T05:27:19Z","timestamp":1300253239000},"page":"363-376","source":"Crossref","is-referenced-by-count":7,"title":["Continuous Blooming of Convex Polyhedra"],"prefix":"10.1007","volume":"27","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Vi","family":"Hart","sequence":"additional","affiliation":[]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[]},{"given":"Joseph","family":"O\u2019Rourke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,17]]},"reference":[{"issue":"1","key":"1024_CR1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.comgeo.2007.05.009","volume":"39","author":"G. Aloupis","year":"2008","unstructured":"Aloupis G., Demaine E.D., Langerman S., Morin P., O\u2019Rourke J., Streinu I., Toussaint G.: Edge-unfolding nested polyhedral bands. Comput. Geom. Theor. Appl. 39(1), 30\u201342 (2008)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"9","key":"1024_CR2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF01782475","volume":"12","author":"E.M. Arkin","year":"1996","unstructured":"Arkin E.M., Held M., Mitchell J.S.B., Skiena S.S.: Hamiltonian triangulations for fast rendering. Vis. Comput. 12(9), 429\u2013444 (1996)","journal-title":"Vis. Comput."},{"key":"1024_CR3","unstructured":"Aloupis, G.: Reconfigurations of Polygonal Structures. PhD thesis, McGill University (2005)"},{"issue":"3","key":"1024_CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02293047","volume":"8","author":"B. Aronov","year":"1992","unstructured":"Aronov B., O\u2019Rourke J.: Nonoverlap of the star unfolding. Discret. Comput. Geom. 8(3), 219\u2013250 (1992)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"1024_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0925-7721(02)00091-3","volume":"24","author":"M. Bern","year":"2003","unstructured":"Bern M., Demaine E.D., Eppstein D., Kuo E., Mantler A., Snoeyink J.: Ununfoldable polyhedra with convex faces. Comput. Geom. Theor. Appl. 24(2), 51\u201362 (2003)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"3","key":"1024_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.comgeo.2004.12.004","volume":"31","author":"T. Biedl","year":"2005","unstructured":"Biedl T., Lubiw A., Sun J.: When can a net fold to a polyhedron?. Comput. Geom. Theor. Appl. 31(3), 207\u2013218 (2005)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"Suppl","key":"1024_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s00373-007-0701-8","volume":"23","author":"M. Damian","year":"2007","unstructured":"Damian M., Flatland R., O\u2019Rourke J.: Epsilon-unfolding orthogonal polyhedra. Graphs Comb. 23(Suppl), 179\u2013194 (2007)","journal-title":"Graphs Comb."},{"key":"1024_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511735172","volume-title":"Geometric Folding Algorithms: Linkages, Origami, Polyhedra","author":"E.D. Demaine","year":"2007","unstructured":"Demaine E.D., O\u2019Rourke J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, New York (2007)"},{"key":"1024_CR9","unstructured":"Itoh, J., O\u2019Rourke, J., V\u00eeilcu, C.: Source unfoldings of convex polyhedra with respect to certain closed polygonal curves. In: Abstracts from the 25th European Workshop on Computational Geometry, Brussels, Belgium (March 2009)"},{"key":"1024_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00454-009-9223-x","volume":"44","author":"J.-i. Itoh","year":"2010","unstructured":"Itoh J.-i., O\u2019Rourke J., V\u00eelcu C.: Star unfolding convex polyhedra via quasigeodesic loops. Discret. Comput. Geom. 44, 35\u201354 (2010)","journal-title":"Discret. Comput. Geom."},{"key":"1024_CR11","doi-asserted-by":"crossref","unstructured":"Miller, E., Pak, I.: Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings. Discret. Comput. Geom. 39(1\u20133):339\u2013388 (March 2008, first manuscript in 2003)","DOI":"10.1007\/s00454-008-9052-3"},{"key":"1024_CR12","unstructured":"O\u2019Rourke, J.: An extension of Cauchy\u2019s arm lemma with application to curve development. In: Akiyama, J., Kano, M., Urabe, M. (eds), Revised Papers from the Japan Conference on Discrete and Computational Geometry, volume 2098 of Lecture Notes in Computer Science, pp. 280\u2013291, Tokyo, Japan (2000)"},{"key":"1024_CR13","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J.: Unfolding orthogonal polyhedra. In: Goodman, J.E., Pach, J., Pollack, R. (eds), Surveys on Discrete and Computational Geometry: Twenty Years Later, pp. 231\u2013255. American Mathematical Society (2008)","DOI":"10.1090\/conm\/453\/08805"},{"key":"1024_CR14","unstructured":"Pak, I., Pinchasi, R.: How to cut out a convex polyhedron (2009, manuscript)"},{"issue":"1","key":"1024_CR15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"Sharir M., Schorr A.: On shortest paths in polyhedral spaces. SIAM J. Comput. 15(1), 193\u2013215 (1986)","journal-title":"SIAM J. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1024-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1024-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1024-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T10:44:04Z","timestamp":1637405044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1024-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,17]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["1024"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1024-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,17]]}}}