{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:51:11Z","timestamp":1767340271693},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642249822"},{"type":"electronic","value":"9783642249839"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24983-9_4","type":"book-chapter","created":{"date-parts":[[2011,11,7]],"date-time":"2011-11-07T00:07:20Z","timestamp":1320624440000},"page":"27-43","source":"Crossref","is-referenced-by-count":5,"title":["Making Polygons by Simple Folds and One Straight Cut"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Hawksley","sequence":"additional","affiliation":[]},{"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Po-Ru","family":"Loh","sequence":"additional","affiliation":[]},{"given":"Shelly","family":"Manber","sequence":"additional","affiliation":[]},{"given":"Omari","family":"Stephens","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.comgeo.2004.03.012","volume":"29","author":"E.M. Arkin","year":"2004","unstructured":"Arkin, E.M., Bender, M.A., Demaine, E.D., Demaine, M.L., Mitchell, J.S.B., Sethia, S., Skiena, S.S.: When can you fold a map? Computational Geometry: Theory and Applications\u00a029(1), 23\u201346 (2004)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"#cr-split#-4_CR2.1","doi-asserted-by":"crossref","unstructured":"1. Bern, M., Demaine, E., Eppstein, D., Hayes, B.: A disk-packing algorithm for an origami magic trick. In: Origami3: Proceedings of the 3rd International Meeting of Origami Science, Math, and Education, Monterey, California, pp. 17-28 (March 2001)","DOI":"10.1201\/b15735-4"},{"key":"#cr-split#-4_CR2.2","unstructured":"2. Improvement of version appearing in Proceedings of the International Conference on Fun with Algorithms, Isola d'Elba, Italy, pp. 32-42 (June 1998)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-46515-7_9","volume-title":"Discrete and Computational Geometry","author":"E.D. Demaine","year":"2000","unstructured":"Demaine, E.D., Demaine, M.L., Lubiw, A.: Folding and Cutting Paper. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol.\u00a01763, pp. 104\u2013118. Springer, Heidelberg (2000)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(99)00056-5","volume":"16","author":"E.D. Demaine","year":"2000","unstructured":"Demaine, E.D., Demaine, M.L., Mitchell, J.S.B.: Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. Computational Geometry: Theory and Applications\u00a016(1), 3\u201321 (2000)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"4_CR5","unstructured":"Demaine, E.D., Devadoss, S.L., Mitchell, J.S.B., O\u2019Rourke, J.: Continuous foldability of polygonal paper. In: Proceedings of the 16th Canadian Conference on Computational Geometry, Montr\u00e9al, Canada, pp. 64\u201367 (August 2004)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press (July 2007)","DOI":"10.1017\/CBO9780511735172"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"A.A. Melkman","year":"1987","unstructured":"Melkman, A.A.: On-line construction of the convex hull of a simple polyline. Information Processing Letters\u00a025(1), 11\u201312 (1987)","journal-title":"Information Processing Letters"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01901268","volume":"1","author":"J.D. Wolter","year":"1985","unstructured":"Wolter, J.D., Woo, T.C., Volz, R.A.: Optimal algorithms for symmetry detection in two and three dimensions. The Visual Computer\u00a01(1), 37\u201348 (1985)","journal-title":"The Visual Computer"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry, Graphs and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24983-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T00:28:27Z","timestamp":1560904107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24983-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642249822","9783642249839"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24983-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}