{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T06:26:49Z","timestamp":1719469609692},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0925-7721(01)00037-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:47:40Z","timestamp":1027615660000},"page":"85-95","source":"Crossref","is-referenced-by-count":11,"title":["Reconfiguring convex polygons"],"prefix":"10.1016","volume":"20","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Jeff","family":"Erickson","sequence":"additional","affiliation":[]},{"given":"Ferran","family":"Hurtado","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Overmars","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Soss","sequence":"additional","affiliation":[]},{"given":"Godfried T.","family":"Toussaint","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00037-2_BIB001","author":"Aronov"},{"key":"10.1016\/S0925-7721(01)00037-2_BIB002","unstructured":"T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, S. Whitesides. Locked and unlocked polygonal chains in 3D, Technical Report 060, Smith College, 1999. A preliminary version appeared in the Proceedings of the 10th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Baltimore, MD, January 1999, pp. 866\u2013867"},{"key":"10.1016\/S0925-7721(01)00037-2_BIB003","series-title":"Proceedings of the 10th Annual International Symposium on Algorithms and Computation, Chennai, India","first-page":"415","article-title":"Convexifying monotone polygons","volume":"1741","author":"Biedl","year":"1999"},{"key":"10.1016\/S0925-7721(01)00037-2_BIB004","doi-asserted-by":"crossref","unstructured":"J.A. Calvo, D. Krizanc, P. Morin, M. Soss, G. Toussaint, Convexifying polygons with simple projections, 2001","DOI":"10.1016\/S0020-0190(01)00150-8"},{"issue":"8","key":"10.1016\/S0925-7721(01)00037-2_BIB005","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1142\/S0218216598000553","article-title":"Nontrivial embeddings of polygonal intervals and unknots in 3-space","volume":"7","author":"Cantarella","year":"1998","journal-title":"J. Knot Theory Ramific."},{"key":"10.1016\/S0925-7721(01)00037-2_BIB006","first-page":"87","article-title":"Deuxi\u00e8me m\u00e9moire sur les polygones et poly\u00e8dres (Second memoire on polygons and polyhedra)","volume":"9","author":"Cauchy","year":"1813","journal-title":"J. de l'\u00c9cole Polytechn."},{"key":"10.1016\/S0925-7721(01)00037-2_BIB007","series-title":"Congr\u00e8s de la Victoire, Association Fran\u00e7aise pour l'Avancement des Sciences","first-page":"91","article-title":"Vari\u00e9t\u00e9s et corps convexes","author":"Choquet","year":"1945"},{"key":"10.1016\/S0925-7721(01)00037-2_BIB008","series-title":"Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, Canada","article-title":"Polygonal chains cannot lock in 4D","author":"Cocan","year":"1999"},{"key":"10.1016\/S0925-7721(01)00037-2_BIB009","series-title":"Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA","first-page":"432","article-title":"Straightening polygonal arcs and convexifying polygonal cycles","author":"Connelly","year":"2000"},{"key":"10.1016\/S0925-7721(01)00037-2_BIB010","series-title":"Polyhedra","first-page":"219","article-title":"Equality, rigidity, and flexibility","author":"Cromwell","year":"1997"},{"key":"10.1016\/S0925-7721(01)00037-2_BIB011","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1088\/0305-4470\/23\/9\/021","article-title":"The pivot algorithm and polygons: results on the FCC lattice","volume":"23","author":"Janse van Rensburg","year":"1990","journal-title":"J. Phys. A Math. Gen. Phys."},{"key":"10.1016\/S0925-7721(01)00037-2_BIB012","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02574031","article-title":"Reconfiguring closed polygonal chains in Euclidean d-space","volume":"13","author":"Lenhart","year":"1995","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00037-2_BIB013","series-title":"The Thirteen Books of Euclid's Elements Translated from the Text of Heiberg with Introduction and Commentary","author":"Little Heath","year":"1956"},{"key":"10.1016\/S0925-7721(01)00037-2_BIB014","series-title":"The Self-Avoiding Walk","author":"Madras","year":"1993"},{"key":"10.1016\/S0925-7721(01)00037-2_BIB015","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01022990","article-title":"The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk","volume":"50","author":"Madras","year":"1988","journal-title":"J. Statist. Phys."},{"issue":"3","key":"10.1016\/S0925-7721(01)00037-2_BIB016","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1142\/S0218216594000204","article-title":"Knotting of regular polygons in 3-space","volume":"3","author":"Millett","year":"1994","journal-title":"J. Knot Theory Ramific."},{"key":"10.1016\/S0925-7721(01)00037-2_BIB017","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00181475","article-title":"Stretching chords of space curves","volume":"2","author":"Sallee","year":"1973","journal-title":"Geometriae Dedicata"},{"issue":"4","key":"10.1016\/S0925-7721(01)00037-2_BIB018","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.4153\/CJM-1967-096-4","article-title":"Cauchy's lemma concerning convex polygons","volume":"19","author":"Schoenberg","year":"1967","journal-title":"Canad. J. Math."},{"issue":"2","key":"10.1016\/S0925-7721(01)00037-2_BIB019","first-page":"195","article-title":"On the existence and constructability of inscribed polygons","volume":"34","author":"Schreiber","year":"1993","journal-title":"Beitr\u00e4ge Algebra Geom."},{"key":"10.1016\/S0925-7721(01)00037-2_BIB020","series-title":"Vorlesungen \u00fcber die Theorie der Polyeder","author":"Steinitz","year":"1934"},{"key":"10.1016\/S0925-7721(01)00037-2_BIB021","series-title":"Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, Canada","article-title":"The Erdős\u2013Nagy theorem and its ramifications","author":"Toussaint","year":"1999"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000372?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000372?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T16:54:05Z","timestamp":1556211245000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0925772101000372"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00037-2","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}