{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T09:15:31Z","timestamp":1649150131895},"reference-count":11,"publisher":"Elsevier BV","issue":"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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0020-0190(01)00150-8","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"81-86","source":"Crossref","is-referenced-by-count":4,"title":["Convexifying polygons with simple projections"],"prefix":"10.1016","volume":"80","author":[{"given":"Jorge Alberto","family":"Calvo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Soss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Godfried","family":"Toussaint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00150-8_BIB001","series-title":"Proc. 12th Canadian Conference on Computational Geometry, Fredericton, New Brunswick","article-title":"Reconfiguring convex polygons","author":"Aichholzer","year":"2000"},{"key":"10.1016\/S0020-0190(01)00150-8_BIB002","series-title":"Proc. 10th ACM-SIAM Symposium on Discrete Algorithms","first-page":"866","article-title":"Locked and unlocked polygonal chains in 3D","author":"Biedl","year":"1999"},{"key":"10.1016\/S0020-0190(01)00150-8_BIB003","series-title":"Proc. 10th International Symposium on Algorithms and Computation, Chennai, India","first-page":"415","article-title":"Convexifying monotone polygons","author":"Biedl","year":"1999"},{"key":"10.1016\/S0020-0190(01)00150-8_BIB004","series-title":"Graph Drawing (Proc. GD'95)","first-page":"52","article-title":"Drawing nice projections of objects in space","volume":"1027","author":"Bose","year":"1996"},{"issue":"8","key":"10.1016\/S0020-0190(01)00150-8_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 Ramifications"},{"key":"10.1016\/S0020-0190(01)00150-8_BIB006","series-title":"Proc. 16th European Workshop on Computational Geometry, Eliat, Israel","article-title":"Every polygon can be untangled","author":"Connelly","year":"2000"},{"key":"10.1016\/S0020-0190(01)00150-8_BIB007","series-title":"Proc. 10th Canadian Conference on Computational Geometry","first-page":"2","article-title":"Convexifying star-shaped polygons","author":"Everett","year":"1998"},{"key":"10.1016\/S0020-0190(01)00150-8_BIB008","series-title":"Unravelling DNA","author":"Frank-Kamenetskii","year":"1997"},{"key":"10.1016\/S0020-0190(01)00150-8_BIB009","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1126\/science.283.5404.931d","article-title":"Random samples: Locked but not knotted","volume":"283","author":"Holden","year":"1999","journal-title":"Science"},{"key":"10.1016\/S0020-0190(01)00150-8_BIB010","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\/S0020-0190(01)00150-8_BIB011","series-title":"Proc. 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California","article-title":"A combinatorial approach to planar non-colliding robot arm motion planning","author":"Streinu","year":"2000"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001508?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001508?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:23:09Z","timestamp":1556209389000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001001508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0020019001001508"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00150-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}