{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:38:22Z","timestamp":1743064702303,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-22203-0_28","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"389-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Morphing Rectangular Duals"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3501-4608","authenticated-orcid":false,"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8917-5269","authenticated-orcid":false,"given":"Jonathan","family":"Klawitter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3794-4406","authenticated-orcid":false,"given":"Ignaz","family":"Rutter","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"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"issue":"2","key":"28_CR1","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":"28_CR2","doi-asserted-by":"publisher","unstructured":"Angelini, P., Chaplick, S., Cornelsen, S., Da Lozzo, G., Roselli, V.: Morphing contact representations of graphs. In: Barequet, G., Wang, Y. (eds.) Symp. Comput. Geom. (SoCG). LIPIcs, vol. 129, pp. 10:1\u201310:16. Schloss Dagstuhl - LZI (2019). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.10","DOI":"10.4230\/LIPIcs.SoCG.2019.10"},{"key":"28_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.) Symp. Comput. Geom. (SoCG). LIPIcs, vol. 34, pp. 126\u2013140. Schloss Dagstuhl - LZI (2015). https:\/\/doi.org\/10.4230\/LIPIcs.SOCG.2015.126","DOI":"10.4230\/LIPIcs.SOCG.2015.126"},{"issue":"3","key":"28_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 Alg. Appl. 23(3), 579\u2013602 (2019). https:\/\/doi.org\/10.7155\/jgaa.00503","journal-title":"J. Graph Alg. Appl."},{"key":"28_CR5","doi-asserted-by":"publisher","unstructured":"Barrera-Cruz, F., Haxell, P., Lubiw, A.: Morphing schnyder drawings of Planar Triangulations. Discrete CMS. Geom. 61(1), 161\u2013184 (2018). https:\/\/doi.org\/10.1007\/s00454-018-0018-9","DOI":"10.1007\/s00454-018-0018-9"},{"key":"28_CR6","doi-asserted-by":"publisher","unstructured":"Biedl, T., Lubiw, A., Petrick, M., Spriggs, M.: Morphing orthogonal planar graph drawings. ACM Trans. Algorithms 9(4) (2013). https:\/\/doi.org\/10.1145\/2500118","DOI":"10.1145\/2500118"},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976). https:\/\/doi.org\/10.1016\/S0022-0000(76)80045-1","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-33024-7_3","volume-title":"Geographic Information Science","author":"K Buchin","year":"2012","unstructured":"Buchin, K., Speckmann, B., Verdonschot, S.: Evolution strategies for optimizing rectangular cartograms. In: Xiao, N., Kwan, M.-P., Goodchild, M.F., Shekhar, S. (eds.) GIScience 2012. LNCS, vol. 7478, pp. 29\u201342. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33024-7_3"},{"issue":"5","key":"28_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1080\/00029890.1944.11999082","volume":"51","author":"SS Cairns","year":"1944","unstructured":"Cairns, S.S.: Deformations of plane rectilinear complexes. Amer. Math. Monthly 51(5), 247\u2013252 (1944). https:\/\/doi.org\/10.1080\/00029890.1944.11999082","journal-title":"Amer. Math. Monthly"},{"key":"28_CR10","doi-asserted-by":"publisher","unstructured":"Chambers, E.W., Erickson, J., Lin, P., Parsa, S.: How to morph graphs on the torus. In: Marx, D. (ed.) Symp. Discrete Algorithms (SODA), pp. 2759\u20132778 (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.164","DOI":"10.1137\/1.9781611976465.164"},{"key":"28_CR11","doi-asserted-by":"publisher","unstructured":"Chaplick, S., Kindermann, P., Klawitter, J., Rutter, I., Wolff, A.: Morphing rectangular duals (2022). https:\/\/doi.org\/10.48550\/ARXIV.2112.03040","DOI":"10.48550\/ARXIV.2112.03040"},{"key":"28_CR12","doi-asserted-by":"publisher","unstructured":"Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 213\u2013248. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_12","DOI":"10.1007\/978-1-4614-0110-0_12"},{"key":"28_CR13","doi-asserted-by":"publisher","unstructured":"Florisson, S., van Kreveld, M.J., Speckmann, B.: Rectangular cartograms: construction & animation. In: Mitchell, J.S.B., Rote, G. (eds.) ACM Symp. Comput. Geom. (SoCG), pp. 372\u2013373 (2005). https:\/\/doi.org\/10.1145\/1064092.1064152","DOI":"10.1145\/1064092.1064152"},{"issue":"2","key":"28_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H de Fraysseix","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Combin. Prob. Comput. 3(2), 233\u2013246 (1994). https:\/\/doi.org\/10.1017\/S0963548300001139","journal-title":"Combin. Prob. Comput."},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/11618058_17","volume-title":"Graph Drawing","author":"\u00c9 Fusy","year":"2006","unstructured":"Fusy, \u00c9.: Transversal structures on triangulations, with application to straight-line drawing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 177\u2013188. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11618058_17"},{"key":"28_CR16","doi-asserted-by":"publisher","unstructured":"Fusy, \u00c9.: Transversal structures on triangulations: a combinatorial study and straight-line drawings. Discrete Math. 309(7), 1870\u20131894 (2009). https:\/\/doi.org\/10.1016\/j.disc.2007.12.093","DOI":"10.1016\/j.disc.2007.12.093"},{"issue":"3","key":"28_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"KR Gabriel","year":"1969","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Biol. 18(3), 259\u2013278 (1969). https:\/\/doi.org\/10.2307\/2412323","journal-title":"Syst. Biol."},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-35802-0_3","volume-title":"Graph Drawing and Network Visualization","author":"A van Goethem","year":"2019","unstructured":"van Goethem, A., Speckmann, B., Verbeek, K.: Optimal morphs of planar orthogonal drawings II. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 33\u201345. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_3"},{"issue":"6","key":"28_CR19","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1137\/0222072","volume":"22","author":"X He","year":"1993","unstructured":"He, X.: On finding the rectangular duals of planar triangular graphs. SIAM J. Comput. 22(6), 1218\u20131226 (1993). https:\/\/doi.org\/10.1137\/0222072","journal-title":"SIAM J. Comput."},{"key":"28_CR20","doi-asserted-by":"publisher","unstructured":"Heilmann, R., Keim, D.A., Panse, C., Sips, M.: Recmap: rectangular map approximations. In: Ward, M.O., Munzner, T. (eds.) IEEE Symp. Inform. Vis. (InfoVis), pp. 33\u201340 (2004). https:\/\/doi.org\/10.1109\/INFVIS.2004.57","DOI":"10.1109\/INFVIS.2004.57"},{"key":"28_CR21","unstructured":"Hoffmann, M., van Kreveld, M.J., Kusters, V., Rote, G.: Quality ratios of measures for graph drawing styles. In: Canadian Conf. Comput. Geom. (CCCG) (2014). http:\/\/www.cccg.ca\/proceedings\/2014\/papers\/paper05.pdf"},{"issue":"1","key":"28_CR22","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoret. Comput. Sci. 172(1), 175\u2013193 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(95)00257-X","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"28_CR23","doi-asserted-by":"publisher","first-page":"113","DOI":"10.7155\/jgaa.00162","volume":"12","author":"SG Kobourov","year":"2008","unstructured":"Kobourov, S.G., Landis, M.: Morphing planar graphs in spherical space. J. Graph Alg. Appl. 12(1), 113\u2013127 (2008). https:\/\/doi.org\/10.7155\/jgaa.00162","journal-title":"J. Graph Alg. Appl."},{"key":"28_CR24","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wiss. zu Leipzig. Math.-Phys. Klasse 88, pp. 141\u2013164 (1936)"},{"issue":"2","key":"28_CR25","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K Ko\u017ami\u0144ski","year":"1985","unstructured":"Ko\u017ami\u0144ski, K., Kinnen, E.: Rectangular duals of planar graphs. Netw. 15(2), 145\u2013157 (1985). https:\/\/doi.org\/10.1002\/net.3230150202","journal-title":"Netw."},{"key":"28_CR26","doi-asserted-by":"publisher","unstructured":"Leinwand, S.M., Lai, Y.: An algorithm for building rectangular floor-plans. In: 21st Design Automation Conference, pp. 663\u2013664 (1984). https:\/\/doi.org\/10.1109\/DAC.1984.1585874","DOI":"10.1109\/DAC.1984.1585874"},{"issue":"3","key":"28_CR27","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1111\/cgf.12932","volume":"35","author":"S Nusrat","year":"2016","unstructured":"Nusrat, S., Kobourov, S.G.: The state of the art in cartograms. Comput. Graph. Forum 35(3), 619\u2013642 (2016). https:\/\/doi.org\/10.1111\/cgf.12932","journal-title":"Comput. Graph. Forum"},{"key":"28_CR28","doi-asserted-by":"publisher","unstructured":"Purchase, Helen C.., Hoggan, Eve, G\u00f6rg, Carsten: How Important is the mental map an empirical investigation of a dynamic graph layout algorithm. In: Kaufmann, Michael, Wagner, Dorothea (eds.) GD 2006. LNCS, vol. 4372. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_19","DOI":"10.1007\/978-3-540-70904-6_19"},{"key":"28_CR29","doi-asserted-by":"publisher","unstructured":"Raisz, E.: The rectangular statistical cartogram. Geogr. Review 24(2), 292\u2013296 (1934). https:\/\/doi.org\/10.2307\/208794. http:\/\/www.jstor.org\/stable\/208794","DOI":"10.2307\/208794"},{"key":"28_CR30","unstructured":"Steadman, P.: Graph theoretic representation of architectural arrangement. Archit. Res. Teach. 2(3) 161\u2013172 (1973)"},{"issue":"3","key":"28_CR31","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.comgeo.2006.06.002","volume":"37","author":"MJ van Kreveld","year":"2007","unstructured":"van Kreveld, M.J., Speckmann, B.: On rectangular cartograms. Comput. Geom. Theory Appl. 37(3), 175\u2013187 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.06.002","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"28_CR32","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/S0895480191266700","volume":"8","author":"GKH Yeap","year":"1995","unstructured":"Yeap, G.K.H., Sarrafzadeh, M.: Sliceable floorplanning by graph dualization. SIAM J. Discrete Math. 8(2), 258\u2013280 (1995). https:\/\/doi.org\/10.1137\/S0895480191266700","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22203-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:05:50Z","timestamp":1704351950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"70","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":"25","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":"7","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":"36% - 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.01","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.03","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)"}}]}}