{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T06:53:51Z","timestamp":1781765631466,"version":"3.54.5"},"reference-count":38,"publisher":"Wiley","license":[{"start":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T00:00:00Z","timestamp":1781654400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T00:00:00Z","timestamp":1781654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100004052","name":"King Abdullah University of Science and Technology","doi-asserted-by":"publisher","award":["BAS\/1\/1680\u201001\u201001"],"award-info":[{"award-number":["BAS\/1\/1680\u201001\u201001"]}],"id":[{"id":"10.13039\/501100004052","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computer Graphics Forum"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Orthogonal graph layout algorithms aim to produce clear, compact, and readable network diagrams by arranging nodes and edges along horizontal and vertical lines, while minimizing bends and crossings. Most existing orthogonal layout methods focus primarily on quality criteria such as area usage, total edge length, and bend minimization. Explicitly controlling the global aspect ratio (AR) of the resulting layout is as of now unexplored. Existing orthogonal layout methods offer no control over the resulting AR and their rigid geometric constraints make adaptation of finished layouts difficult. With the increasing variety of aspect ratios encountered in daily life, from wide monitors to tall mobile devices or fixed\u2010size interface panels, there is a clear need for aspect ratio control in orthogonal layout methods. To tackle this issue, we introduce Aspect Ratio\u2010Constrained Orthogonal Layout (ARCOL). Building upon the Human\u2010like Orthogonal Layout Algorithm (HOLA) [KDMW16], we integrate aspect ratio at two different stages: (1) into the stress minimization phase, as a soft constraint, allowing the layout algorithm to gently guide node positions toward a specified target AR, while preserving visual clarity and topological faithfulness; and (2) into the tree reattachment phase, where we modify the cost function to favor placements that improve the AR. We evaluate our approach through quantitative evaluation and a user study, as well as expert interviews. Our evaluations show that ARCOL produces balanced and space efficient orthogonal layouts across diverse aspect ratios.<\/jats:p>","DOI":"10.1111\/cgf.70437","type":"journal-article","created":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T06:15:23Z","timestamp":1781763323000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ARCOL: Aspect Ratio Constrained Orthogonal Layout"],"prefix":"10.1111","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7756-0901","authenticated-orcid":false,"given":"Zainab","family":"Alsuwaykit","sequence":"first","affiliation":[{"name":"King Abdullah University of Science and Technology  Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9001-789X","authenticated-orcid":false,"given":"Yousef","family":"Rajeh","sequence":"additional","affiliation":[{"name":"King Abdullah University of Science and Technology  Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0915-369X","authenticated-orcid":false,"given":"Alexandre","family":"Kouyoumdjian","sequence":"additional","affiliation":[{"name":"King Abdullah University of Science and Technology  Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7038-9237","authenticated-orcid":false,"given":"Steve","family":"Kieffer","sequence":"additional","affiliation":[{"name":"Alpine Mathematics  Saratoga Springs NY USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5766-7215","authenticated-orcid":false,"given":"Dominik","family":"Engel","sequence":"additional","affiliation":[{"name":"King Abdullah University of Science and Technology  Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9517-3526","authenticated-orcid":false,"given":"Sara Di","family":"Bartolomeo","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien  Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien  Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4248-6574","authenticated-orcid":false,"given":"Ivan","family":"Viola","sequence":"additional","affiliation":[{"name":"King Abdullah University of Science and Technology  Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2026,6,17]]},"reference":[{"key":"e_1_2_8_2_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-030-68766-3_1","volume-title":"Graph Drawing and Network Visualization","author":"Ahmed R.","year":"2020"},{"key":"e_1_2_8_3_2","unstructured":"BoosD. D. BrownieC.:Comparing variances and other measures of dispersion. 4"},{"key":"e_1_2_8_4_2","first-page":"1","volume-title":"Revised Papers from the 10th International Symposium on Graph Drawing","author":"Brandes U.","year":"2002"},{"key":"e_1_2_8_5_2","first-page":"37","volume-title":"Proceedings of the 5th Annual European Symposium on Algorithms","author":"Biedl T. C.","year":"1997"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00026-6"},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1986.6312901"},{"key":"e_1_2_8_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00066-9"},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.GD.2025.41"},{"key":"e_1_2_8_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109924"},{"key":"e_1_2_8_11_2","unstructured":"DuncanC. A. GoodrichM. T.:Planar orthogonal and polyline drawing algorithms. InHandbook of Graph Drawing and Visualization TamassiaR. (Ed.). CRC Press 2013 ch. 7 pp.223\u2013246. 2"},{"key":"e_1_2_8_12_2","doi-asserted-by":"crossref","unstructured":"Di GiacomoE. DidimoW. LiottaG. MontecchianiF.: Network visualization retargeting. In2015 6th International Conference on Information Intelligence Systems and Applications (IISA)(2015) pp.1\u20136. doi:10.1109\/IISA.2015.7388095. 4","DOI":"10.1109\/IISA.2015.7388095"},{"key":"e_1_2_8_13_2","first-page":"111","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing","author":"Duncan C. A.","year":"1998"},{"key":"e_1_2_8_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(96)00005-3"},{"key":"e_1_2_8_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.156"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/11618058_15"},{"key":"e_1_2_8_17_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781032692388"},{"key":"e_1_2_8_18_2","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/3-540-45848-4_30","volume-title":"Graph Drawing","author":"Freivalds K.","year":"2002"},{"key":"e_1_2_8_19_2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-63938-1_57","volume-title":"Graph Drawing","author":"F\u00f6\u03b2meier U.","year":"1997"},{"key":"e_1_2_8_20_2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-030-96731-4_7","volume-title":"WALCOM: Algorithms and Computation","author":"Felsner S.","year":"2022"},{"key":"e_1_2_8_21_2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-030-04414-5_13","volume-title":"Graph Drawing and Network Visualization","author":"J\u00fcnger M.","year":"2018"},{"key":"e_1_2_8_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2467451"},{"key":"e_1_2_8_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2004.08.015"},{"key":"e_1_2_8_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2004.06.008"},{"key":"e_1_2_8_25_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.GD.2025.30"},{"key":"e_1_2_8_26_2","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.1558"},{"key":"e_1_2_8_27_2","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-540-77537-9_38","volume-title":"Graph Drawing","author":"Nachmanson L.","year":"2008"},{"key":"e_1_2_8_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00017-5"},{"key":"e_1_2_8_29_2","doi-asserted-by":"publisher","DOI":"10.1006\/jvlc.2002.0232"},{"key":"e_1_2_8_30_2","doi-asserted-by":"crossref","unstructured":"R\u00fceggU. AdolfM. CyrukM. FlohrA. M. vonHanxledenR.:Minimum-width graph layering revisited 2017. doi:10.21941\/bii\/1701. 2","DOI":"10.21941\/bii\/1701"},{"key":"e_1_2_8_31_2","unstructured":"RaschkaS.:About feature scaling and normalization and the effect of standardization for machine learning algorithms. doi:10.13140\/2.1.4245.1849. 4"},{"key":"e_1_2_8_32_2","doi-asserted-by":"crossref","unstructured":"R\u00fceggU.:Sugiyama Layouts for Prescribed Drawing Areas.PhD thesis Kiel University Kiel 2011. doi:10.21941\/kcss\/2018\/1. 2","DOI":"10.21941\/kcss\/2018\/1"},{"key":"e_1_2_8_33_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01956.x"},{"key":"e_1_2_8_34_2","doi-asserted-by":"publisher","DOI":"10.4018\/IJACDT.2019010103"},{"key":"e_1_2_8_35_2","volume-title":"Information Visualization: Perception for Design","author":"Ware C.","year":"2012"},{"key":"e_1_2_8_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2012.07.006"},{"key":"e_1_2_8_37_2","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-019-2779-4"},{"key":"e_1_2_8_38_2","unstructured":"yWorks GmbH:yFiles 2024. Part of yFiles Graph Drawing Library yWorks GmbH. URL:https:\/\/docs.yworks.com\/yfileshtml\/. 2 3"},{"key":"e_1_2_8_39_2","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00401"}],"container-title":["Computer Graphics Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/cgf.70437","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1111\/cgf.70437","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/cgf.70437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T06:15:29Z","timestamp":1781763329000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/cgf.70437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,17]]},"references-count":38,"alternative-id":["10.1111\/cgf.70437"],"URL":"https:\/\/doi.org\/10.1111\/cgf.70437","archive":["Portico"],"relation":{},"ISSN":["0167-7055","1467-8659"],"issn-type":[{"value":"0167-7055","type":"print"},{"value":"1467-8659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,17]]},"assertion":[{"value":"2026-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70437"}}