{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T22:36:09Z","timestamp":1784673369279,"version":"3.55.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T00:00:00Z","timestamp":1503878400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T00:00:00Z","timestamp":1503878400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1422311"],"award-info":[{"award-number":["CCF-1422311"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1423615"],"award-info":[{"award-number":["CCF-1423615"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1408763"],"award-info":[{"award-number":["CCF-1408763"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00454-017-9918-3","type":"journal-article","created":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T13:44:10Z","timestamp":1503927850000},"page":"785-821","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Recognizing Weakly Simple Polygons"],"prefix":"10.1007","volume":"58","author":[{"given":"Hugo A.","family":"Akitaya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Greg","family":"Aloupis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeff","family":"Erickson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,8,28]]},"reference":[{"key":"9918_CR1","doi-asserted-by":"crossref","unstructured":"Abel, Z., Demaine, E.D., Demaine, M.L., Eppstein, D., Lubiw, A., Uehara, R.: Flat foldings of plane graphs with prescribed angles and edge lengths. In: M\u00f6hring, R., Raman, R. (eds.) Graph Drawing (GD\u201914). Lecture Notes in Computer Science, vol. 8871, pp. 272\u2013283. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-662-45803-7_23"},{"issue":"1","key":"9918_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.comgeo.2004.03.012","volume":"29","author":"EM 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? Comput. Geom. 29(1), 23\u201346 (2004)","journal-title":"Comput. Geom."},{"key":"9918_CR3","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: Duncan, C., Symvonis, A. (eds.) Algorithms\u2014ESA 2002. Lecture Notes in Computer Science, vol. 2461, pp. 152\u2013164. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45749-6_17"},{"key":"9918_CR4","unstructured":"Bern, M., Hayes, B.: The complexity of flat origami. In: Proceedings of the the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 175\u2013183. ACM, New York (1996)"},{"key":"9918_CR5","doi-asserted-by":"crossref","unstructured":"Chang, H.-C., Erickson, J., Xu, C.: Detecting weakly simple polygons. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1655\u20131670. SIAM, Philadelphia (2015)","DOI":"10.1137\/1.9781611973730.110"},{"issue":"5","key":"9918_CR6","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6(5), 485\u2013524 (1991)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"9918_CR7","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1137\/S0097539700370539","volume":"34","author":"R Cole","year":"2005","unstructured":"Cole, R., Hariharan, R.: Dynamic LCA queries on trees. SIAM J. Comput. 34(4), 894\u2013923 (2005)","journal-title":"SIAM J. Comput."},{"key":"9918_CR8","doi-asserted-by":"crossref","unstructured":"Connelly, R., Demaine, E.D., Rote, G.: Infinitesimally locked self-touching linkages with applications to locked trees. In: Physical Knots: Knotting, Linking, and Folding of Geometric Objects in $$\\mathbb{R}^3$$. Contemporary Mathematics, vol. 304, pp. 287\u2013311. American Mathematical Society, Providence (2002)","DOI":"10.1090\/conm\/304\/05200"},{"issue":"7","key":"9918_CR9","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.1016\/j.disc.2007.12.090","volume":"309","author":"PF Cortese","year":"2009","unstructured":"Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: On embedding a cycle in a plane graph. Discrete Math. 309(7), 1856\u20131869 (2009)","journal-title":"Discrete Math."},{"key":"9918_CR10","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. 3rd edn. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"9918_CR11","doi-asserted-by":"crossref","unstructured":"Dietz, P.F., Sleator, D.D.: Two algorithms for maintaining order in a list. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC\u201987), pp. 365\u2013372. ACM, New York (1987). Full version in Tech. Rep. CMU-CS-88-113, Carnegie Mellon University, Pittsburgh (1988)","DOI":"10.1145\/28395.28434"},{"key":"9918_CR12","unstructured":"Francke, A., T\u00f3th, Cs.D.: A census of plane graphs with polyline edges. SIAM J. Discrete Math. 31(2), 1174\u20131195 (2017)"},{"key":"9918_CR13","unstructured":"Fulek, R.: Embedding graphs into embedded graphs. \n                    arXiv:1608.02087\n                    \n                   (2016)"},{"key":"9918_CR14","unstructured":"Fulek, R., Kyn\u010d, J.: Hanani-Tutte for approximating maps of graphs. \n                    arXiv:1705.05243\n                    \n                   (2017)"},{"issue":"1","key":"9918_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s13366-011-0047-5","volume":"53","author":"B Gr\u00fcnbaum","year":"2012","unstructured":"Gr\u00fcnbaum, B.: Polygons: Meister was right and Poinsot was wrong but prevailed. Beitr. Algebra Geom. 53(1), 57\u201371 (2012)","journal-title":"Beitr. Algebra Geom."},{"key":"9918_CR16","first-page":"305","volume":"22","author":"P Minc","year":"1997","unstructured":"Minc, P.: Embedding of simplicial arcs into the plane. Topol. Proc. 22, 305\u2013340 (1997)","journal-title":"Topol. Proc."},{"key":"9918_CR17","unstructured":"Mor, A.R.: Realization and Counting Problems for Planar Structures: Trees and Linkages, Polytopes and Polyominoes, Ph.D. thesis, Freie Universit\u00e4t Berlin, Berlin (2006)"},{"key":"9918_CR18","doi-asserted-by":"crossref","unstructured":"Shamos, M.I., Hoey, D.: Geometric intersection problems. In: Proceedings of the 17th Annual Symposium on Foundations of Computer Science (FOCS\u201976), pp. 208\u2013215. IEEE (1976)","DOI":"10.1109\/SFCS.1976.16"},{"issue":"1","key":"9918_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-8641(03)00069-5","volume":"134","author":"M Skopenkov","year":"2003","unstructured":"Skopenkov, M.: On approximability by embeddings of cycles in the plane. Topol. Appl. 134(1), 1\u201322 (2003)","journal-title":"Topol. Appl."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-017-9918-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9918-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9918-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:36:55Z","timestamp":1589697415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-017-9918-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,28]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["9918"],"URL":"https:\/\/doi.org\/10.1007\/s00454-017-9918-3","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,28]]},"assertion":[{"value":"1 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}