{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:51:26Z","timestamp":1743072686588,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030687656"},{"type":"electronic","value":"9783030687663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-68766-3_20","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"250-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Turn-Regular Orthogonal Representations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3414-7444","authenticated-orcid":false,"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9110","authenticated-orcid":false,"given":"Carla","family":"Binucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4224-1550","authenticated-orcid":false,"given":"Giuseppe Di","family":"Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2565-090X","authenticated-orcid":false,"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8345-5806","authenticated-orcid":false,"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9806-7411","authenticated-orcid":false,"given":"Maurizio","family":"Patrignani","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"}]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"key":"20_CR1","volume-title":"Network Flows - Theory, Algorithms and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows - Theory, Algorithms and Applications. Prentice Hall, Upper Saddle River (1993)"},{"issue":"2\u20133","key":"20_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C Batini","year":"1984","unstructured":"Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entity relationship diagrams. J. Syst. Softw. 4(2\u20133), 163\u2013173 (1984)","journal-title":"J. Syst. Softw."},{"key":"20_CR3","unstructured":"Bekos, M.A., et al.: On turn-regular orthogonal representations. Technical report arXiv:2008.09002, Cornell University (2020)"},{"issue":"3","key":"20_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"TC Biedl","year":"1998","unstructured":"Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"issue":"5","key":"20_CR5","doi-asserted-by":"publisher","first-page":"587","DOI":"10.7155\/jgaa.00241","volume":"15","author":"C Binucci","year":"2011","unstructured":"Binucci, C., Di Giacomo, E., Didimo, W., Rextin, A.: Switch-regular upward planarity testing of directed trees. J. Graph Algorithms Appl. 15(5), 587\u2013629 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0925-7721(99)00054-1","volume":"16","author":"SS Bridgeman","year":"2000","unstructured":"Bridgeman, S.S., Di Battista, G., Didimo, W., Liotta, G., Tamassia, R., Vismara, L.: Turn-regularity and optimal area drawings of orthogonal representations. Comput. Geom. 16(1), 53\u201393 (2000)","journal-title":"Comput. Geom."},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-70904-6_9","volume-title":"Graph Drawing","author":"J Carlson","year":"2007","unstructured":"Carlson, J., Eppstein, D.: Trees with convex faces and optimal angles. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 77\u201388. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_9"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"635","DOI":"10.7155\/jgaa.00265","volume":"16","author":"S Cornelsen","year":"2012","unstructured":"Cornelsen, S., Karrenbauer, A.: Accelerated bend minimization. J. Graph Algorithms Appl. 16(3), 635\u2013650 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR9","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River (1999)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-37623-2_6","volume-title":"Graph Drawing","author":"G Di Battista","year":"1998","unstructured":"Di Battista, G., Liotta, G.: Upward planarity checking: \u201cfaces are more than polygons\u201d. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 72\u201386. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_6"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Didimo, W., Liotta, G.: Graph visualization and data mining. In: Mining Graph Data, pp. 35\u201364. Wiley (2007)","DOI":"10.1002\/9780470073049.ch3"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.7155\/jgaa.00127","volume":"10","author":"W Didimo","year":"2006","unstructured":"Didimo, W.: Upward planar drawings and switch-regularity heuristics. J. Graph Algorithms Appl. 10(2), 259\u2013285 (2006)","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR13","unstructured":"Duncan, C.A., Goodrich, M.T.: Planar orthogonal and polyline drawing algorithms. In: Handbook of Graph Drawing and Visualization, pp. 223\u2013246. Chapman and Hall\/CRC (2013)"},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1057\/palgrave.ivs.9500078","volume":"3","author":"M Eiglsperger","year":"2004","unstructured":"Eiglsperger, M., et al.: Automatic layout of UML class diagrams in orthogonal style. Inf. Vis. 3(3), 189\u2013208 (2004)","journal-title":"Inf. Vis."},{"key":"20_CR15","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-030-41590-7_8","volume-title":"Computer Vision, Imaging and Computer Graphics Theory and Applications","author":"AM Esser","year":"2020","unstructured":"Esser, A.M.: Orthogonal compaction: turn-regularity, complete extensions, and their common concept. In: Cl\u00e1udio, A.P., et al. (eds.) VISIGRAPP 2019. CCIS, vol. 1182, pp. 179\u2013202. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41590-7_8"},{"key":"20_CR16","unstructured":"Evans, W.S., Fleszar, K., Kindermann, P., Saeedi, N., Shin, C.S., Wolff, A.: Minimum rectilinear polygons for given angle sequences. Technical report arXiv:1606.06940, Cornell University (2020)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Even, S., Tarjan, R.E.: Corrigendum: Computing an st-numbering. TCS 2(1976), 339\u2013344. Theoret. Comput. Sci. 4(1), 123 (1977)","DOI":"10.1016\/0304-3975(76)90086-4"},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.amc.2005.03.007","volume":"172","author":"SM Hashemi","year":"2006","unstructured":"Hashemi, S.M., Tahmasbi, M.: A better heuristic for area-compaction of orthogonal representations. App. Math. Comput. 172(2), 1054\u20131066 (2006)","journal-title":"App. Math. Comput."},{"volume-title":"Graph Drawing Software","year":"2004","key":"20_CR19","unstructured":"J\u00fcnger, M., Mutzel, P. (eds.): Graph Drawing Software. Springer, Heidelberg (2004)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44969-8","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-48777-8_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"GW Klau","year":"1999","unstructured":"Klau, G.W., Mutzel, P.: Optimal compaction of orthogonal grid drawings (extended abstract). In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 304\u2013319. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48777-8_23"},{"key":"20_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. B. G. Teubner\/Wiley, Stuttgart (1990)"},{"key":"20_CR23","unstructured":"Nishizeki, T., Chiba, N.: Hamiltonian cycles (chap. 10). In: Planar Graphs: Theory and Algorithms, pp. 171\u2013184. Courier Dover Publications (2008)"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. Lecture Notes Series on Computing, vol.\u00a012. World Scientific (2004)","DOI":"10.1142\/5648"},{"issue":"1","key":"20_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0925-7721(01)00010-4","volume":"19","author":"M Patrignani","year":"2001","unstructured":"Patrignani, M.: On the complexity of orthogonal compaction. Comput. Geom. 19(1), 47\u201367 (2001)","journal-title":"Comput. Geom."},{"issue":"3","key":"20_CR26","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"20_CR27","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0214027","volume":"14","author":"G Vijayan","year":"1985","unstructured":"Vijayan, G., Wigderson, A.: Rectilinear graphs and their embeddings. SIAM J. Comput. 14(2), 355\u2013372 (1985)","journal-title":"SIAM J. Comput."}],"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-030-68766-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:03:49Z","timestamp":1739401429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2021","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":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2020.cs.ubc.ca\/","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":"82","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":"29","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":"9","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":"35% - 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,02","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":"3","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}