{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T05:04:01Z","timestamp":1768626241334,"version":"3.49.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031521126","type":"print"},{"value":"9783031521133","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_17","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"240-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Morphing Graph Drawings in\u00a0the\u00a0Presence of\u00a0Point Obstacles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9450-7640","authenticated-orcid":false,"given":"Oksana","family":"Firman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4770-3391","authenticated-orcid":false,"given":"Tim","family":"Hegemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3765","authenticated-orcid":false,"given":"Boris","family":"Klemz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1136-5673","authenticated-orcid":false,"given":"Felix","family":"Klesen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7491-2811","authenticated-orcid":false,"given":"Marie Diana","family":"Sieper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-718X","authenticated-orcid":false,"given":"Johannes","family":"Zink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"17_CR1","unstructured":"Aichholzer, O.: Convexifying polygons without losing visibilities. In: Aloupis, G. Bremner, (eds.) CCCG, pp. 229\u2013234 (2011). http:\/\/www.cccg.ca\/proceedings\/2011\/papers\/paper70.pdf"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/16M1069171","volume":"46","author":"S Alamdari","year":"2017","unstructured":"Alamdari, S., et al.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824\u2013852 (2017). https:\/\/doi.org\/10.1137\/16M1069171","journal-title":"SIAM J. Comput."},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Angelini, P., Da Lozzo, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V.: Optimal morphs of convex drawings. In: Arge, L., Pach, J., (eds.) SoCG. LIPIcs, vol. 34 pp. 126\u2013140. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.SOCG.2015.126","DOI":"10.4230\/LIPIcs.SOCG.2015.126"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"579","DOI":"10.7155\/jgaa.00503","volume":"23","author":"E Arseneva","year":"2019","unstructured":"Arseneva, E., et al.: Pole dancing: 3D morphs for tree drawings. J. Graph Algorithms Appl. 23(3), 579\u2013602 (2019). https:\/\/doi.org\/10.7155\/jgaa.00503","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00623","volume":"27","author":"E Arseneva","year":"2023","unstructured":"Arseneva, E., Gangopadhyay, R., Istomina, A.: Morphing tree drawings in a small 3D grid. J. Graph Algorithms Appl. 27(4), 241\u2013279 (2023). https:\/\/doi.org\/10.7155\/jgaa.00623","journal-title":"J. Graph Algorithms Appl."},{"key":"17_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-031-23101-8_6","volume-title":"SOFSEM 2023","author":"K Buchin","year":"2023","unstructured":"Buchin, K., et al.: Morphing planar graph drawings through 3D. In: G\u0105sieniec, L. (ed.) SOFSEM 2023. LNCS, vol. 13878, pp. 80\u201395. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-23101-8_6"},{"issue":"5","key":"17_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1080\/00029890.1944.11999082","volume":"51","author":"S Cairns","year":"1944","unstructured":"Cairns, S.: Deformations of plane rectilinear complexes. Am. Math. Monthly 51(5), 247\u2013252 (1944)","journal-title":"Am. Math. Monthly"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Colin de Verdi\u00e9re, \u00c9., de Mesmay, A.: Testing graph isotopy on surfaces. Discrete Comput. Geom. 51, 171\u2013206 (2014). https:\/\/doi.org\/10.1007\/s00454-013-9555-4","DOI":"10.1007\/s00454-013-9555-4"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00454-003-0006-7","volume":"30","author":"R Connelly","year":"2003","unstructured":"Connelly, R., Demaine, E.D., Rote, G.: Straightening polygonal arcs and convexifying polygonal cycles. Discrete Comput. Geom. 30, 205\u2013239 (2003). https:\/\/doi.org\/10.1007\/s00454-003-0006-7","journal-title":"Discrete Comput. Geom."},{"issue":"10","key":"17_CR10","doi-asserted-by":"publisher","first-page":"2985","DOI":"10.1007\/s00453-020-00714-6","volume":"82","author":"G Da Lozzo","year":"2020","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Upward planar morphs. Algorithmica 82(10), 2985\u20133017 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00714-6","journal-title":"Algorithmica"},{"key":"17_CR11","unstructured":"Firman, O., et al.: Morphing graph drawings in the presence of point obstacles. ArXiv report (2023). http:\/\/arxiv.org\/abs\/2311.14516"},{"key":"17_CR12","volume-title":"Warping & Morphing of Graphical Objects","author":"J Gomes","year":"1999","unstructured":"Gomes, J., Darsa, L., Costa, B., Velho, L.: Warping & Morphing of Graphical Objects. Morgan Kaufmann, Burlington (1999)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.comgeo.2019.07.007","volume":"84","author":"L Kleist","year":"2019","unstructured":"Kleist, L., Klemz, B., Lubiw, A., Schlipf, L., Staals, F., Strash, D.: Convexity-increasing morphs of planar graphs. Comput. Geom. 84, 69\u201388 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.07.007","journal-title":"Comput. Geom."},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Klemz, B.: Convex drawings of hierarchical graphs in linear time, with applications to planar graph morphing. In: Mutzel, P., Pagh, R., Herman, G., (eds.) ESA, LIPIcs, vol. 204, pp. 57:1\u201357:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.57","DOI":"10.4230\/LIPIcs.ESA.2021.57"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-70904-6_19","volume-title":"Graph Drawing","author":"HC Purchase","year":"2007","unstructured":"Purchase, H.C., Hoggan, E., G\u00f6rg, C.: How important is the \u201cmental map\u2019\u2019? \u2013 an empirical investigation of a dynamic graph layout algorithm. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 184\u2013195. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_19"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0095-8956(83)90038-2","volume":"34","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Deformations of plane graphs. J. Combin. Theory Ser. B 34(3), 244\u2013257 (1983). https:\/\/doi.org\/10.1016\/0095-8956(83)90038-2","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:04:07Z","timestamp":1711569847000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}