{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:32:47Z","timestamp":1756463567154},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_7","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T18:16:36Z","timestamp":1252952196000},"page":"71-82","source":"Crossref","is-referenced-by-count":4,"title":["Cauchy\u2019s Theorem for Orthogonal Polyhedra of Genus 0"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkay","family":"Genc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-22343-7","volume-title":"Proofs from THE BOOK","author":"M. Aigner","year":"1998","unstructured":"Aigner, M., Ziegler, G.: Proofs from THE BOOK, 1st edn. Springer, Heidelberg (1998); 3rd edn. (2004)","edition":"1"},{"key":"7_CR2","unstructured":"Biedl, T., Genc, B.: When can a graph form an orthogonal polyhedron. In: Canadian Conference on Computational Geometry (CCCG 2004), August 2004, pp. 53\u201356 (2004)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Biedl, T., Genc, B.: Cauchy\u2019s theorem for orthogonal polyhedra of genus 0. Technical Report CS-2008-26, University of Waterloo, School of Computer Science (2008)","DOI":"10.1007\/978-3-642-04128-0_7"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-73951-7_35","volume-title":"Algorithms and Data Structures","author":"T.C. Biedl","year":"2007","unstructured":"Biedl, T.C., Lubiw, A., Spriggs, M.J.: Cauchy\u2019s theorem and edge lengths of convex polyhedra. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 398\u2013409. Springer, Heidelberg (2007)"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","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? Computational Geometry: Theory and Applications\u00a031(3), 207\u2013218 (2005)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"7_CR6","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. Computational Geometry: Theory and Applications\u00a040, 102\u2013114 (2008)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1070\/RM1999v054n04ABEH000187","volume":"54","author":"N.P. Dolbilin","year":"1999","unstructured":"Dolbilin, N.P., Shtan\u2019ko, M.A., Shtogrin, M.T.: Rigidity of a quadrillage of a torus by squares. Russian Math. Surveys\u00a054(4), 839\u2013840 (1999)","journal-title":"Russian Math. Surveys"},{"key":"7_CR8","unstructured":"Donoso, M., O\u2019Rourke, J.: Nonorthogonal polyhedra built from rectangles. In: 14th Canadian Conference on Computational Geometry (CCCG 2002), pp. 97\u2013100 (2002)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J.: Computational geometry column 49. ACM SIGACT News\u00a038(2) (2007)","DOI":"10.1145\/1272729.1272740"},{"key":"7_CR10","volume-title":"Lectures on Discrete and Polyhedral Geometry","author":"I. Pak","year":"2009","unstructured":"Pak, I.: Lectures on Discrete and Polyhedral Geometry. Cambridge University Press, Cambridge (in print, 2009), http:\/\/www.math.umn.edu\/~pak\/book.htm (last accessed, April 2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:22:18Z","timestamp":1558538538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}