{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T22:36:10Z","timestamp":1784673370008,"version":"3.55.0"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T00:00:00Z","timestamp":1501459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T00:00:00Z","timestamp":1501459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1408763"],"award-info":[{"award-number":["CCF-1408763"]}],"id":[{"id":"10.13039\/100000143","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-9907-6","type":"journal-article","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T15:23:30Z","timestamp":1501514610000},"page":"889-920","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Untangling Planar Curves"],"prefix":"10.1007","volume":"58","author":[{"given":"Hsien-Chih","family":"Chang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5253-2282","authenticated-orcid":false,"given":"Jeff","family":"Erickson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,7,31]]},"reference":[{"key":"9907_CR1","first-page":"1","volume-title":"Singularities and Bifurcations. Advances in Soviet Mathematics","author":"F Aicardi","year":"1994","unstructured":"Aicardi, F.: Tree-like curves. In: Arnold, V.I. (ed.) Singularities and Bifurcations. Advances in Soviet Mathematics, vol. 21, pp. 1\u201331. American Mathematical Society, Providence (1994)"},{"issue":"3","key":"9907_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/opre.8.3.311","volume":"8","author":"SB Akers Jr","year":"1960","unstructured":"Akers Jr., S.B.: The use of wye-delta transformations in network simplification. Oper. Res. 8(3), 311\u2013323 (1960)","journal-title":"Oper. Res."},{"issue":"2","key":"9907_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1090\/S0002-9947-1926-1501346-5","volume":"28","author":"JW Alexander","year":"1926","unstructured":"Alexander, J.W.: Combinatorial analysis situs. Trans. Am. Math. Soc. 28(2), 301\u2013329 (1926)","journal-title":"Trans. Am. Math. Soc."},{"key":"9907_CR4","doi-asserted-by":"crossref","unstructured":"Alexander, J.W., Briggs, G.B.: On types of knotted curves. Ann. Math. 28(1\u20134), 562\u2013586 (1926\/1927)","DOI":"10.2307\/1968399"},{"key":"9907_CR5","unstructured":"Allen, S.R., Barba, L., Iacono, J., Langerman, S.: Incremental Voronoi diagrams. In: Proceedings of the 32nd International Symposium on Computational Geometry (SoCG\u201916), pp. 15:1\u201315:16 (2016) Leibniz International Proceedings in Informatics\u00a051. \n                    http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/5907\n                    \n                  . \n                    http:\/\/arxiv.org\/abs\/1603.08485"},{"issue":"1","key":"9907_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2307\/2944327","volume":"133","author":"S Angenent","year":"1991","unstructured":"Angenent, S.: Parabolic equations for curves on surfaces: II. Intersections, blow-up and generalized solutions. Ann. Math. 133(1), 171\u2013215 (1991)","journal-title":"Ann. Math."},{"issue":"2","key":"9907_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/(SICI)1097-0118(200002)33:2<83::AID-JGT3>3.0.CO;2-P","volume":"33","author":"D Archdeacon","year":"2000","unstructured":"Archdeacon, D., Colbourn, C.J., Gitler, I., Provan, J.S.: Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs. J. Graph Theory 33(2), 83\u201393 (2000)","journal-title":"J. Graph Theory"},{"key":"9907_CR8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1090\/advsov\/021\/02","volume-title":"Singularities and Bifurcations. Advances in Soviet Mathematics","author":"VI Arnold","year":"1994","unstructured":"Arnold, V.I.: Plane curves, their invariants, perestroikas and classifications. In: Arnold, V.I. (ed.) Singularities and Bifurcations. Advances in Soviet Mathematics, vol. 21, pp. 33\u201391. American Mathematical Society, Providence (1994)"},{"key":"9907_CR9","series-title":"University Lecture Series","doi-asserted-by":"crossref","DOI":"10.1090\/ulect\/005","volume-title":"Topological Invariants of Plane Curves and Caustics","author":"VT Arnold","year":"1994","unstructured":"Arnold, V.T.: Topological Invariants of Plane Curves and Caustics. University Lecture Series, vol. 5. American Mathematical Society, Providence (1994)"},{"key":"9907_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008)","edition":"3"},{"key":"9907_CR11","unstructured":"Chang, H.-C., Erickson, J.: Electrical reduction, homotopy moves, and defect (2015). \n                    http:\/\/arxiv.org\/abs\/1510.00571"},{"key":"9907_CR12","unstructured":"Chang, H.-C., Erickson, J.: Untangling planar curves. In: Proceedings of the 32nd International Symposium on Computational Geometry (SoCG\u201916), 29:1\u201329:15 (2016). Leibniz International Proceedings in Informatics, vol. 51. \n                    http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/5921"},{"issue":"1","key":"9907_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/147508.147511","volume":"39","author":"B Chazelle","year":"1992","unstructured":"Chazelle, B., Edelsbrunner, H.: An optimal algorithm for intersecting line segments in the plane. J. ACM 39(1), 1\u201354 (1992)","journal-title":"J. ACM"},{"key":"9907_CR14","unstructured":"Chmutov, S., Duzhin, S., Mostovoy, J.: Introduction to Vassiliev Knot Invariants. Cambridge University Press, Cambridge (2012). \n                    http:\/\/www.pdmi.ras.ru\/~duzhin\/papers\/cdbook\n                    \n                  . \n                    http:\/\/arxiv.org\/abs\/1103.5628"},{"issue":"5","key":"9907_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"KL Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4(5), 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20133","key":"9907_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0166-218X(95)E0111-3","volume":"60","author":"CJ Colbourn","year":"1995","unstructured":"Colbourn, C.J., Provan, J.S., Vertigan, D.: A new approach to solving three combinatorial enumeration problems on planar graphs. Discrete Appl. Math. 60(1\u20133), 119\u2013129 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9907_CR17","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BF02566413","volume":"71","author":"Y Colin de Verdi\u00e8re","year":"1996","unstructured":"Colin de Verdi\u00e8re, Y., Gitler, I., Vertigan, D.: R\u00e9seaux \u00e9lectriques planaires II. Comment. Math. Helv. 71(1), 144\u2013167 (1996)","journal-title":"Comment. Math. Helv."},{"key":"9907_CR18","first-page":"329","volume-title":"Computational Problems in Abstract Algebra","author":"JH Conway","year":"1970","unstructured":"Conway, J.H.: An enumeration of knots and links, and some of their algebraic properties. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 329\u2013358. Pergamon Press, Oxford (1970)"},{"key":"9907_CR19","unstructured":"Coward, A., Lackenby, M.: An upper bound on Reidemeister moves. Am. J. Math. 136(4), 1023\u20131066 (2014). \n                    http:\/\/arxiv.org\/abs\/1104.1882"},{"key":"9907_CR20","unstructured":"Eigenwillig, A., Kerber, M.: Exact and efficient 2D-arrangements of arbitrary algebraic curves. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201908), pp. 122\u2013131. ACM, New York (2008)"},{"key":"9907_CR21","first-page":"13","volume":"7","author":"GV Epifanov","year":"1966","unstructured":"Epifanov, G.V.: Reduction of a plane graph to an edge by a star-triangle transformation. Sov. Math., Dokl. 7, 13\u201317 (1966)","journal-title":"Sov. Math., Dokl."},{"key":"9907_CR22","unstructured":"Even-Zohar, C., Hass, J., Linial, N., Nowik, T.: Invariants of random knots and links. Discrete Comput. Geom. 56(2), 274\u2013314 (2016). \n                    http:\/\/arxiv.org\/abs\/1411.3308"},{"key":"9907_CR23","unstructured":"Feo, T.A.: I. A Lagrangian relaxation method for testing the infeasibility of certain VLSI routing problems. II. Efficient reduction of planar networks for solving certain combinatorial problems. Ph.D. thesis, University of California Berkeley, Berkeley (1985). \n                    http:\/\/search.proquest.com\/docview\/303364161"},{"issue":"3","key":"9907_CR24","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1287\/opre.41.3.572","volume":"41","author":"TA Feo","year":"1993","unstructured":"Feo, T.A., Provan, J.S.: Delta-wye transformations and the efficient reduction of two-terminal planar graphs. Oper. Res. 41(3), 572\u2013582 (1993)","journal-title":"Oper. Res."},{"key":"9907_CR25","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1090\/S0002-9947-1969-0243542-1","volume":"141","author":"GK Francis","year":"1969","unstructured":"Francis, G.K.: The folded ribbon theorem. A contribution to the study of immersed circles. Trans. Am. Math. Soc. 141, 271\u2013303 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"9907_CR26","doi-asserted-by":"crossref","unstructured":"Gau\u00df, C.F.: Nachlass. I. Zur Geometria situs. Werke, vol.\u00a08, pp. 271\u2013281. Teubner (1900) Originally written between 1823 and 1840","DOI":"10.1007\/978-3-642-92474-3_55"},{"key":"9907_CR27","unstructured":"Gitler, I.: Delta-wye-delta transformations: algorithms and applications. Ph.D. thesis, University of Waterloo, Waterloo (1991)"},{"issue":"1","key":"9907_CR28","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1006\/jctb.1997.1754","volume":"70","author":"M de Graaf","year":"1997","unstructured":"de Graaf, M., Schrijver, A.: Making curves minimally crossing by Reidemeister moves. J. Combin. Theory Ser. B 70(1), 134\u2013156 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"9907_CR29","doi-asserted-by":"publisher","first-page":"71","DOI":"10.2307\/1971486","volume":"129","author":"MA Grayson","year":"1989","unstructured":"Grayson, M.A.: Shortening embedded curves. Ann. Math. 129(1), 71\u2013111 (1989)","journal-title":"Ann. Math."},{"key":"9907_CR30","volume-title":"Convex Polytopes. Monographs in Pure and Applied Mathematics","author":"B Gr\u00fcnbaum","year":"1967","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes. Monographs in Pure and Applied Mathematics. Wiley, New York (1967)"},{"issue":"2","key":"9907_CR31","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/282918.282923","volume":"4","author":"LJ Guibas","year":"1985","unstructured":"Guibas, L.J., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph. 4(2), 75\u2013123 (1985)","journal-title":"ACM Trans. Graph."},{"issue":"1","key":"9907_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00454-009-9156-4","volume":"44","author":"J Hass","year":"2010","unstructured":"Hass, J., Nowik, T.: Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle. Discrete Comput. Geom. 44(1), 91\u201395 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20132","key":"9907_CR33","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BF02772960","volume":"51","author":"J Hass","year":"1985","unstructured":"Hass, J., Scott, P.: Intersections of curves on surfaces. Israel J. Math. 51(1\u20132), 90\u2013120 (1985)","journal-title":"Israel J. Math."},{"issue":"1","key":"9907_CR34","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0040-9383(94)90033-7","volume":"33","author":"J Hass","year":"1994","unstructured":"Hass, J., Scott, P.: Shortening curves on surfaces. Topology 33(1), 25\u201343 (1994)","journal-title":"Topology"},{"key":"9907_CR35","unstructured":"Hayashi, C., Hayashi, M.: Minimal sequences of Reidemeister moves on diagrams of torus knots. Proc. Am. Math. Soc. 139(7), 2605\u20132614 (2011). \n                    http:\/\/arxiv.org\/abs\/1003.1349"},{"key":"9907_CR36","doi-asserted-by":"crossref","unstructured":"Hayashi, C., Hayashi, M., Nowik, T.: Unknotting number and number of Reidemeister moves needed for unlinking. Topology Appl. 159(5), 1467\u20131474 (2012). \n                    http:\/\/arxiv.org\/abs\/1012.4131","DOI":"10.1016\/j.topol.2012.01.008"},{"key":"9907_CR37","unstructured":"Hayashi, C., Hayashi, M., Sawada, M., Yamada, S.: Minimal unknotting sequences of Reidemeister moves containing unmatched RII moves. J. Knot Theory Ramifications 21(10), N1250099 (2012). \n                    http:\/\/arxiv.org\/abs\/1011.3963"},{"key":"9907_CR38","first-page":"50","volume":"2","author":"H Hopf","year":"1935","unstructured":"Hopf, H.: \u00dcber die Drehung der Tangenten und Sehnen ebener Kurven. Compos. Math. 2, 50\u201362 (1935)","journal-title":"Compos. Math."},{"issue":"14","key":"9907_CR39","doi-asserted-by":"publisher","first-page":"N1350085","DOI":"10.1142\/S0218216513500855","volume":"22","author":"N Ito","year":"2013","unstructured":"Ito, N., Takimura, Y.: (1,2) and weak (1,3) homotopies on knot projections. J. Knot Theory Ramifications 22(14), N1350085 (2013). Addendum. J. Knot Theory Ramifications 23(8), N1491001 (2014)","journal-title":"J. Knot Theory Ramifications"},{"issue":"12","key":"9907_CR40","first-page":"413","volume":"34","author":"AE Kennelly","year":"1899","unstructured":"Kennelly, A.E.: Equivalence of triangles and three-pointed stars in conducting networks. Electr. World Eng. 34(12), 413\u2013414 (1899)","journal-title":"Electr. World Eng."},{"issue":"6","key":"9907_CR41","doi-asserted-by":"publisher","first-page":"2297","DOI":"10.1090\/S0002-9947-97-01706-6","volume":"349","author":"M Khovanov","year":"1997","unstructured":"Khovanov, M.: Doodle groups. Trans. Am. Math. Soc. 349(6), 2297\u20132315 (1997)","journal-title":"Trans. Am. Math. Soc."},{"key":"9907_CR42","unstructured":"Lackenby, M.: A polynomial upper bound on Reidemeister moves. Ann. Math. 182(2), 491\u2013564 (2015). \n                    http:\/\/arxiv.org\/abs\/1302.0180"},{"key":"9907_CR43","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1137\/0111058","volume":"11","author":"A Lehman","year":"1963","unstructured":"Lehman, A.: Wye-delta transformations in probabilistic network. J. Soc. Indust. Appl. Math. 11, 773\u2013805 (1963)","journal-title":"J. Soc. Indust. Appl. Math."},{"issue":"3\u20134","key":"9907_CR44","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0747-7171(08)80064-8","volume":"10","author":"K Mulmuley","year":"1990","unstructured":"Mulmuley, K.: A fast planar partition algorithm, I. J. Symb. Comput. 10(3\u20134), 253\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"issue":"7","key":"9907_CR45","first-page":"1079","volume":"E79\u2013A","author":"H Nakahara","year":"1996","unstructured":"Nakahara, H., Takahashi, H.: An algorithm for the solution of a linear system by $$\\Delta $$-Y transformations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E79\u2013A(7), 1079\u20131088 (1996). Special section on multi-dimensional mobile information network","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"1","key":"9907_CR46","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1002\/(SICI)1097-0118(200005)34:1<100::AID-JGT9>3.0.CO;2-R","volume":"34","author":"SD Noble","year":"2000","unstructured":"Noble, S.D., Welsh, D.J.A.: Knot graphs. J. Graph Theory 34(1), 100\u2013111 (2000)","journal-title":"J. Graph Theory"},{"issue":"1","key":"9907_CR47","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1215\/00127094-2009-022","volume":"148","author":"T Nowik","year":"2009","unstructured":"Nowik, T.: Complexity of plane and spherical curves. Duke J. Math. 148(1), 107\u2013118 (2009)","journal-title":"Duke J. Math."},{"issue":"2","key":"9907_CR48","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0166-8641(01)00202-4","volume":"123","author":"JM Paterson","year":"2002","unstructured":"Paterson, J.M.: A combinatorial algorithm for immersed loops in surfaces. Topology Appl. 123(2), 205\u2013234 (2002)","journal-title":"Topology Appl."},{"issue":"5","key":"9907_CR49","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1016\/S0040-9383(97)00013-X","volume":"37","author":"M Polyak","year":"1998","unstructured":"Polyak, M.: Invariants of curves and fronts via Gauss diagrams. Topology 37(5), 989\u20131009 (1998)","journal-title":"Topology"},{"issue":"1","key":"9907_CR50","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BF02952507","volume":"5","author":"K Reidemeister","year":"1927","unstructured":"Reidemeister, K.: Elementare Begr\u00fcndung der Knotentheorie. Abh. Math. Sem. Univ. Hamburg 5(1), 24\u201332 (1927)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"issue":"2","key":"9907_CR51","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory Ser. B 52(2), 153\u2013190 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"9907_CR52","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory Ser. B 62(2), 232\u2013348 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9907_CR53","unstructured":"Russell, A.: The method of duality. In: A Treatise on the Theory of Alternating Currents, Chapter XVII, pp. 380\u2013399. Cambridge University Press, Cambridge (1904)"},{"key":"9907_CR54","unstructured":"Song, X.: Implementation issues for Feo and Provan\u2019s delta-wye-delta reduction algorithm. M.Sc. thesis, University of Victoria, Victoria (2001)"},{"issue":"12","key":"9907_CR55","first-page":"1","volume":"III.AB","author":"E Steinitz","year":"1916","unstructured":"Steinitz, E.: Polyeder und Raumeinteilungen. Encyklop\u00e4die der Mathematischen Wissenschaften mit Einschluss ihrer Anwendungen III.AB(12), 1\u2013139 (1916)","journal-title":"Encyklop\u00e4die der Mathematischen Wissenschaften mit Einschluss ihrer Anwendungen"},{"key":"9907_CR56","volume-title":"Vorlesungen \u00dcber die Theorie der Polyeder: unter Einschluss der Elemente der Topologie. Grundlehren der Mathematischen Wissenschaften","author":"E Steinitz","year":"1934","unstructured":"Steinitz, E., Rademacher, H.: Vorlesungen \u00dcber die Theorie der Polyeder: unter Einschluss der Elemente der Topologie. Grundlehren der Mathematischen Wissenschaften, vol. 41. Springer, Berlin (1934)"},{"issue":"2","key":"9907_CR57","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.3230140202","volume":"14","author":"JA Storer","year":"1984","unstructured":"Storer, J.A.: On minimal-node-cost planar embeddings. Networks 14(2), 181\u2013212 (1984)","journal-title":"Networks"},{"issue":"2","key":"9907_CR58","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/jgt.3190130202","volume":"13","author":"K Truemper","year":"1989","unstructured":"Truemper, K.: On the delta-wye reduction for planar graphs. J. Graph Theory 13(2), 141\u2013148 (1989)","journal-title":"J. Graph Theory"},{"key":"9907_CR59","volume-title":"Matroid Decomposition","author":"K Truemper","year":"1992","unstructured":"Truemper, K.: Matroid Decomposition. Academic Press, Boston (1992)"},{"issue":"2","key":"9907_CR60","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"LS Valiant","year":"1981","unstructured":"Valiant, L.S.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 30(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. Comput."},{"key":"9907_CR61","doi-asserted-by":"crossref","unstructured":"Vegter, G.: Kink-free deformation of polygons. In: Proceedings of the 5th Annual Symposium on Computational Geometry (SCG\u201989), pp. 61\u201368. ACM, New York (1989)","DOI":"10.1145\/73833.73840"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-017-9907-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9907-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9907-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:36:00Z","timestamp":1589697360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-017-9907-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,31]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["9907"],"URL":"https:\/\/doi.org\/10.1007\/s00454-017-9907-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,31]]},"assertion":[{"value":"16 July 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}