{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:31:44Z","timestamp":1760441504377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_26","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"318-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Convexity-Increasing Morphs of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Linda","family":"Kleist","sequence":"first","affiliation":[]},{"given":"Boris","family":"Klemz","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"Lena","family":"Schlipf","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Staals","sequence":"additional","affiliation":[]},{"given":"Darren","family":"Strash","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"26_CR1","unstructured":"Aichholzer, O., Aloupis, G., Demaine, E.D., Demaine, M.L., Dujmovic, V., Hurtado, F., Lubiw, A., Rote, G., Schulz, A., Souvaine, D.L., Winslow, A.: Convexifying polygons without losing visibilities. In: Canadian Conference on Computational Geometry (CCCG) (2011)"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1137\/16M1069171","volume":"46","author":"S Alamdari","year":"2017","unstructured":"Alamdari, S., Angelini, P., Barrera-Cruz, F., Chan, T.M., Da Lozzo, G., Di Battista, G., Frati, F., Haxell, P., Lubiw, A., Patrignani, M., Roselli, V., Singla, S., Wilkinson, B.T.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 29 (2017)","journal-title":"SIAM J. Comput."},{"key":"26_CR3","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.) Proceedings of the 31st International Symposium on Computational Geometry (SoCG 2015), Leibniz International Proceedings in Informatics (LIPIcs), vol. 34, pp. 126\u2013140. Dagstuhl, Wadern (2015)"},{"issue":"4","key":"26_CR4","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1037\/h0033117","volume":"78","author":"S Appelle","year":"1972","unstructured":"Appelle, S.: Perception and discrimination as a function of stimulus orientation: the \u201coblique effect\u201d in man and animals. Psychol. Bull. 78(4), 266 (1972)","journal-title":"Psychol. Bull."},{"issue":"5","key":"26_CR5","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":"26_CR6","doi-asserted-by":"crossref","unstructured":"Cantarella, J.H., Demaine, E.D., Iben, H.N., O\u2019Brien, J.F.: An energy-driven approach to linkage unfolding. In: Proceedings of the 20th Annual Symposium on Computational Geometry (SoCG), pp. 134\u2013143. ACM (2004)","DOI":"10.1145\/997817.997840"},{"key":"26_CR7","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. Discret. Comput. Geom. 30, 205\u2013239 (2003)","journal-title":"Discret. Comput. Geom."},{"issue":"2\u20133","key":"26_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61(2\u20133), 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44969-8_6","volume-title":"Drawing Graphs","author":"M Eiglsperger","year":"2001","unstructured":"Eiglsperger, M., Fekete, S.P., Klau, G.W.: Orthogonal graph drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, pp. 121\u2013171. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8_6"},{"issue":"03n04","key":"26_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1142\/S021865439800012X","volume":"4","author":"MS Floater","year":"1998","unstructured":"Floater, M.S.: Parametric Tilings and scattered data approximation. Int. J. Shape Model. 4(03n04), 165\u2013182 (1998)","journal-title":"Int. J. Shape Model."},{"issue":"1\u20132","key":"26_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0377-0427(98)00202-7","volume":"101","author":"MS Floater","year":"1999","unstructured":"Floater, M.S., Gotsman, C.: How to morph tilings injectively. J. Comput. Appl. Math. 101(1\u20132), 117\u2013129 (1999)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"26_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cagd.2005.05.002","volume":"23","author":"SJ Gortler","year":"2006","unstructured":"Gortler, S.J., Gotsman, C., Thurston, D.: Discrete one-forms on meshes and applications to 3D mesh parameterization. Comput. Aided Geomet. Des. 23(2), 83\u2013112 (2006)","journal-title":"Comput. Aided Geomet. Des."},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0097-8493(00)00108-4","volume":"25","author":"C Gotsman","year":"2001","unstructured":"Gotsman, C., Surazhsky, V.: Guaranteed intersection-free polygon morphing. Comput. Graph. 25(1), 67\u201375 (2001)","journal-title":"Comput. Graph."},{"issue":"3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.jda.2009.05.003","volume":"8","author":"S-H Hong","year":"2010","unstructured":"Hong, S.-H., Nagamochi, H.: Convex drawings of hierarchical planar graphs and clustered planar graphs. J. Discrete Algorithms 8(3), 282\u2013295 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"26_CR15","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s00454-009-9145-7","volume":"41","author":"HN Iben","year":"2009","unstructured":"Iben, H.N., O\u2019Brien, J.F., Demaine, E.D.: Refolding planar polygons. Discret. Comput. Geomet. 41(3), 444\u2013460 (2009)","journal-title":"Discret. Comput. Geomet."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Kleist, L., Klemz, B., Lubiw, A., Schlipf, L., Staals, F., Strash, D.: Convexity-increasing morphs of planar graphs. CoRR, abs\/1802.06579 (2018)","DOI":"10.1007\/978-3-030-00256-5_26"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 296\u2013303. ACM (2014)","DOI":"10.1145\/2608628.2608664"},{"issue":"2","key":"26_CR18","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM J. Numer. Anal. 16(2), 346\u2013358 (1979)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"26_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/jgt.10168","volume":"46","author":"J Pach","year":"2004","unstructured":"Pach, J., T\u00f3th, G.: Monotone drawings of planar graphs. J. Graph Theory 46(1), 39\u201347 (2004)","journal-title":"J. Graph Theory"},{"key":"26_CR20","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\u201d? \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":"1","key":"26_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TVCG.2010.269","volume":"18","author":"HC Purchase","year":"2012","unstructured":"Purchase, H.C., Pilcher, C., Plimmer, B.: Graph drawing aesthetics\u2013created by users, not algorithms. IEEE Trans. Vis. Comput. Graph. 18(1), 81\u201392 (2012)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-27848-8","volume-title":"Encyclopedia of Algorithms","author":"S Rahman","year":"2015","unstructured":"Rahman, S.: Convex graph drawing. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1\u20137. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-642-27848-8"},{"issue":"1","key":"26_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00454-010-9301-0","volume":"45","author":"A Rib\u00f3 Mor","year":"2011","unstructured":"Rib\u00f3 Mor, A., Rote, G., Schulz, A.: Small grid embeddings of 3-polytopes. Discret. Comput. Geomet. 45(1), 65\u201387 (2011)","journal-title":"Discret. Comput. Geomet."},{"issue":"3","key":"26_CR24","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)","journal-title":"J. Combin. Theory, Ser. B"},{"issue":"1","key":"26_CR25","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"3","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. 3(1), 743\u2013767 (1963)","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00256-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:26:07Z","timestamp":1710336367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cottbus","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","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":"66","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":"30","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":"45% - 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":"4","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":"11,5","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)"}}]}}