{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T16:55:02Z","timestamp":1763225702499},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423065"},{"type":"electronic","value":"9783540477389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47738-1_9","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T17:52:49Z","timestamp":1194371569000},"page":"113-124","source":"Crossref","is-referenced-by-count":11,"title":["Folding and Unfolding Linkages, Paper, and Polyhedra"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"issue":"2","key":"9_CR1","first-page":"57","volume":"10","author":"H.-K. Ahn","year":"2000","unstructured":"H.-K. Ahn, P. Bose, J. Czyzowicz, N. Hanusse, E. Kranakis, and P. Morin. Flipping your lid. Geombinatorics, 10(2):57\u201363, 2000.","journal-title":"Geombinatorics"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"E. M. Arkin, M. A. Bender, E. D. Demaine, M. L. Demaine, J. S. B. Mitchell, S. Sethia. and S.S. Skiena. When can you fold a map? Computing Research Repository cs.CG\/0011026, Nov, 2000. http:\/\/www\/aeXiv.org\/abs\/cs.CG\/0011026 .","DOI":"10.1007\/3-540-44634-6_37"},{"key":"9_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proc. Japan Conf. Discrete Comput. Geom.","author":"O. Aichholzer","year":"2000","unstructured":"O. Aichholzer, C. Cort\u00e9s, E. D. Demaine, V. Sujmovi\u0107, J. Erickson, H. Meijer, M. Overmars, B. Palop, S. Ramaswami, and G. T. Toussaint. Flipturning polygons. In Proc. Japan Conf. Discrete Comput. Geom., Lecture Notes in Comput. Sci., Tokyo, Japan, Nov. 2000. To appear in Descrete and Computational Geometry."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"O. Aichholzer, E. D. Demaina, J. Erickson, F. Hurtado, M. Overmars, M. A. Soss, and G. T. Toussaint. Reconfiguring convex polygons. Comput. Geom. Theory Appl., 2001. To appear.","DOI":"10.1016\/S0925-7721(01)00037-2"},{"key":"9_CR5","unstructured":"B. Aronov, J. E. Goodman, and R. Pollack. Convexification of planar polygons in R3. Manuscript, Oct. 1999. http:\/\/www.math.nyu.edu\/faculty\/pollack\/convexifyingapolygon10-27-99.ps ."},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF02293047","volume":"8","author":"B. Aronov","year":"1992","unstructured":"B. Aronov and J. O\u2019Rourke. Nonoverlap of the star unfolding. Discrete Comput. Geom., 8(3):219\u2013250, 1992.","journal-title":"Discrete Comput. Geom."},{"key":"9_CR7","unstructured":"T. Beidl, E. Demaine, M. Demaine, A. Lubiw, M. Overmars, J. O.\u2019Rourke, S. Robbins, and S. Whitesides. Unfolding some classes of orthogonal polyhedra. In Proc. 10th Canadian Conf. Comput. Geom., Montr\u00e9al, Canada, Aug. 1998. http:\/\/cgm.cs.mcgill.ca\/cccg98\/proceedings\/cccg98-biedl-unfolding.ps.gz ."},{"key":"9_CR8","unstructured":"T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O\u2019Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides. Locked and unlocked polygonal chains in 3D. Technical Report 060, Smith College, 1999. A preliminary version appeared in the Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, Baltimore, Maryland, Jan. 1999, pages 866\u2013867."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O\u2019Rourke, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides. A note on reconfiguring tree linkages: Trees can lock. Discrete Appl. Math., 2001. To appear.","DOI":"10.1016\/S0166-218X(01)00229-3"},{"key":"9_CR10","unstructured":"M. Bern, E. D. Demaine, D. Eppstein, E. Kuo, A. Mantler, and J. Snoeyink. Ununfoldable polyhedra with convex faces. Comput. Geom. Theory Appl. 2001. To appear."},{"key":"9_CR11","unstructured":"M. Bern, E. Demaine, D. Eppstein, and B. Hayes, A disk-packing algorithm for an origami magic trick. In Proc. Internat. Conf. Fun with Algorithms, Isola d\u2019Elba, Italy, June 1998."},{"key":"9_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-46632-0_42","volume-title":"Proc. Internat. Symp. Algorithms and Computation","author":"T. C. Biedl","year":"1999","unstructured":"T. C. Biedl, E. D. Demaine, S. Lazard, S. M. Robbins, and M. A. Soss. Convexifying monotone polygons. In Proc. Internat. Symp. Algorithms and Computation, volume 1741 of Lecture Notes in Comput. Sci., pages 415\u2013424, Chennai, India, Dec. 1999."},{"key":"9_CR13","unstructured":"M. Bern and B. Hayes. The complexity of flat origami. In Proc. 7th ACMSIAM Sympos. Discrete Algorithms, pages 175\u2013183, Atlanta, Jan. 1996."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"R. Connelly, E. D. Demaine, and G. Rote. Straightening polygonal arcs and convexifying polygonal cycles. In Proc. 41st IEEE Sympos. Found. Comp. Sci., pages 432\u2013442, Redondo Beach, California, Nov. 2000.","DOI":"10.1109\/SFCS.2000.892131"},{"issue":"8","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1142\/S0218216598000553","volume":"7","author":"J. Cantarella","year":"1998","unstructured":"J. Cantarella and H. Johnston. Nontrivial embeddings of polygonal intervals and unknots in 3-space. J. Knot Theory Ramifications, 7(8):1027\u20131039, 1998.","journal-title":"J. Knot Theory Ramifications"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"J.A. Calvo, D. Krizanc, P. Morin, M. Soss, and G. Toussaint. Convexifying polygons with simple projections. Infor. Process. Lett., 2001. To appear.","DOI":"10.1016\/S0020-0190(01)00150-8"},{"key":"9_CR17","unstructured":"R. Cocan and J. O\u2019Rourke. Polygonal chains cannot lock in 4D. In Proc. 11th Canadian Conf. Comput. Geom., Vancouver, Canada. Aug. 1999. http:\/\/www.cs.ubc.ca\/conferences\/CCCG\/elec_proc\/c17.ps.gz ."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"E. D. Demaine and M. L. Demaine. Recent results in computational origami. In Proc. 3rd Internat. Meeting of Origami Science, Math, and Education, Monterey, California, March 2001. To appear.","DOI":"10.1201\/b15735-3"},{"key":"9_CR19","series-title":"Lect Notes Comput Sci","first-page":"104","volume-title":"Revised Papers from the Japan Conf. Discrete Comput. Geom.","author":"E. D. Demaine","year":"1998","unstructured":"E. D. Demaine, M. L. Demaine, and A. Lubiw. Folding and cutting paper. In J. Akiyama, M. Kano, and M. Urabe, editors, Revised Papers from the Japan Conf. Discrete Comput. Geom., volume 1763 of Lecture Notes in Comput. Sci., pages 104\u2013117, Tokyo, Japan, Dec. 1998."},{"key":"9_CR20","unstructured":"E. D. Demaine, M. L. Demaine, and A. Lubiw. Flattening polyhedra. Manuscript, 2000."},{"key":"9_CR21","volume-title":"Technical Report 069","author":"E. Demaine","year":"2000","unstructured":"E. Demaine, M. Demaine, A. Lubiw, and J. O\u2019Rourke. Examples, counterexamples, and enumeration results for foldings and unfoldings between polygons and polytopes. Technical Report 069, Smith College, Northampton, MA, July 2000."},{"key":"9_CR22","series-title":"Lect Notes Comput Sci","volume-title":"Proc. Japan Conf. Discrete Comput. Geom.","author":"E. D. Demaine","year":"2000","unstructured":"E. D. Demaine, M. L. Demaine, A. Lubiw, and J. O\u2019Rourke. Enumerating foldings and unfoldings between polygons and polytopes. In Proc. Japan Conf. Discrete Comput. Geom., Lecture Notes in Comput. Sci., Tokyo, Japan, Nov. 2000."},{"issue":"1","key":"9_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(99)00056-5","volume":"16","author":"E. D. Demaine","year":"2000","unstructured":"E. D. Demaine, M. L. Demaine, and J. S. B. Mitchell. Folding flat silhouttes and wrapping polyhedral packages: New results in computational origami. Comput. Geom. Theory Appl., 16(1):3\u201321, 2000.","journal-title":"Comput. Geom. Theory Appl."},{"key":"9_CR24","volume-title":"The Painter\u2019s Manual: A Manual of Measurement of Lines, Areas, and Solids by Means of Compass and Ruler Assembled by Albrecht D\u00fcrer for the Use of All Lovers of Art with Appropriate Illustrations Arranged to be Printed in the Year MDXXV","author":"A. D\u00fcrer","year":"1977","unstructured":"A. D\u00fcrer. The Painter\u2019s Manual: A Manual of Measurement of Lines, Areas, and Solids by Means of Compass and Ruler Assembled by Albrecht D\u00fcrer for the Use of All Lovers of Art with Appropriate Illustrations Arranged to be Printed in the Year MDXXV. Abaris Books, Inc., New York, 1977. English translation of Unterweysung der Messung mit dem Zirkel un Richtscheyt in Linien Ebnen uhnd Gantzen Corporen, 1525."},{"key":"9_CR25","unstructured":"H. Everett, S. Lazard, S. Robbins, H. Schr\u00f6der, and S. Whitesides. Convexifying star-shaped polygons. In Proc. 10th Canadian Conf. Comput. Geom., Montr\u00e9al, Canada, Aug. 1998. http:\/\/cgm.cs.mcgill.ca\/cccg98\/proceedings\/cccg98-everett-convexifying.ps.gz ."},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"627","DOI":"10.2307\/2301373","volume":"42","author":"P. Erd\u00f6s","year":"1935","unstructured":"P. Erd\u00f6s. Problem 3763. Amer. Math. Monthly, 42:627, 1935.","journal-title":"Amer. Math. Monthly"},{"key":"9_CR27","unstructured":"T. Fevens, A. Hernandez, A. Mesa, M. Soss, and G. Toussaint. Simple polygons that cannot be deflated. Beitr\u00e4ge Algebra Geom., 2001. To appear."},{"key":"9_CR28","unstructured":"M. Gardner. The combinatorics of paper folding. In Wheels, Life and Other Mathematical Amusements, chapter 7, pages 60\u201373. W. H. Freeman and Company, 1983."},{"key":"9_CR29","first-page":"24","volume":"5","author":"B. G\u00fcnbaum","year":"1995","unstructured":"B. G\u00fcnbaum. How to convexify a polygon. Geombinatorics, 5:24\u201330, July 1995.","journal-title":"Geombinatorics"},{"key":"9_CR30","first-page":"215","volume":"100","author":"T. Hull","year":"1994","unstructured":"T. Hull. On the mathematics of flat origamis. Congr. Numer., 100:215\u2013224, 1994.","journal-title":"Congr. Numer."},{"key":"9_CR31","unstructured":"J. Justin. Towards a mathematical theory of origami. In K. Miura, editor, Proc. 2nd Internat. Meeting of Origami Science and Scientific Origami, pages 15\u201329, Otsu, Japan, November\u2014December, 1994."},{"key":"9_CR32","unstructured":"T. Kawasaki. On the relation betwen mountain-creases and valley-creases of a flat origami. In H. Huzita, editor, Proc. 1st Internat. Meeting of Origami Science and Technology, pages 229\u2013237, Ferrara, Italy, Dec. 1989. An unabridged Japanese version appeared in Sasebo College of Technology Report, 27:153\u2014157, 1990."},{"issue":"1","key":"9_CR33","doi-asserted-by":"crossref","first-page":"133","DOI":"10.4310\/jdg\/1214457034","volume":"42","author":"M. Kapovich","year":"1995","unstructured":"M. Kapovich and J. Millson. On the moduli space of polygons in the Euclidean plane. J. Differential Geom., 42(1):133\u2013164, 1995.","journal-title":"J. Differential Geom."},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"R. J. Lang. A computational algorithm for origami design. In Proc. 12th Sympos. Comput. Geom., pages 98\u2013105, Philadelphia, PA, May 1996.","DOI":"10.1145\/237218.237249"},{"key":"9_CR35","unstructured":"A. Lubiw and J. O\u2019Rourke. When can a polygon fold to a polytope? Technical Report 048, Smith College, June 1996."},{"issue":"1","key":"9_CR36","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1093\/comjnl\/14.1.75","volume":"14","author":"W. F. Lunnon","year":"1971","unstructured":"W. F. Lunnon. Multi-dimensional map-folding. The Computer Journal, 14(1):75\u201380, Feb. 1971.","journal-title":"The Computer Journal"},{"key":"9_CR37","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02574031","volume":"13","author":"W. J. Lenhart","year":"1995","unstructured":"W. J. Lenhart and S. H. Whitesides. Reconfiguring closed polygonal chaines in Euclidean d-space. Discrete Comput. Geom., 13:123\u2013140, 1995.","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"9_CR38","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/0216045","volume":"16","author":"J. S. B. Mitchell","year":"1987","unstructured":"J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., 16(4):644\u2013668, Aug. 1987.","journal-title":"SIAM J. Comput."},{"key":"9_CR39","unstructured":"J. Montroll. African Animals in Origami. Dover Publications, 1991."},{"key":"9_CR40","doi-asserted-by":"publisher","first-page":"176","DOI":"10.2307\/2302483","volume":"46","author":"B. Nagy","year":"1939","unstructured":"B. Nagy. Solution to problem 3763. Amer. Math. Monthly, 46:176\u2013177, Mar. 1939.","journal-title":"Amer. Math. Monthly"},{"key":"9_CR41","series-title":"Lect Notes Comput Sci","first-page":"258","volume-title":"Revised Papers from the Japan Conf. Discrete Comput. Geom.","author":"J. O\u2019Rourke","year":"1998","unstructured":"J. O\u2019Rourke. Folding and unfolding in computational geometry. In Revised Papers from the Japan Conf. Discrete Comput. Geom., volume 1763 of Lecture Notes in Comput. Sci., pages 258\u2013266, Tokyo, Japan, Dec. 1998."},{"key":"9_CR42","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00181475","volume":"2","author":"G. T. Sallee","year":"1973","unstructured":"G. T. Sallee. Stretching chords of space curves. Geom. Dedicata, 2:311\u2013315, 1973.","journal-title":"Geom. Dedicata"},{"key":"9_CR43","unstructured":"C. Schevon. Algorithms for Geodesics on Polytopes. PhD thesis, Johns Hopkins University, 1989."},{"key":"9_CR44","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1017\/S0305004100051860","volume":"78","author":"G. C. Shephard","year":"1975","unstructured":"G. C. Shephard. Convex polytopes with convex nets. Math. Proc. Cambridge Philos. Soc., 78:389\u2013403, 1975.","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"I. Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. 41st IEEE Sympos. Found. Comp. Sci., pages 443\u2013453, Redondo Beach, California, Nov. 2000.","DOI":"10.1109\/SFCS.2000.892132"},{"key":"9_CR46","unstructured":"G. Toussaint. Computational polygonal entanglement theory. In Proceedings of the VIII Encuentros de Geometria Computational. Castellon, Spain, July 1999."},{"key":"9_CR47","unstructured":"G. Toussaint. The Erd\u00f6s-Nagy theorem and its ramifications. In Proc. 11th Canadian Conf. Comput. Geom., Vancouver, Canada, Aug. 1999. http:\/\/www.cs.ubc.ca\/conferences\/CCCG\/elec_proc\/fp19.ps.gz ."},{"key":"9_CR48","unstructured":"G. Toussaint. A New class of stuck unknots in pol 6. Beitr\u00e4ge Algebra Geom., 2001. To appear."},{"issue":"2","key":"9_CR49","first-page":"42","volume":"24","author":"S. Whitesides","year":"1992","unstructured":"S. Whitesides. Algorithmic issues in the geometry of planar linkage movement. Australian Computer Journal, 24(2):42\u201350, May 1992.","journal-title":"Australian Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47738-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T12:46:13Z","timestamp":1684068373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47738-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423065","9783540477389"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/3-540-47738-1_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}