Recent empirical works on graph drawing have investigated visual properties of graph drawings created by users based on adjacency lists of graphs as well as drawing behaviors. This is mainly done by asking participants to sketch these graphs on a tablet computer so that they can freely express their interpretation. However, previous works did not consider weighted vertices, i.e., assigning a weight to a vertex to reflect its importance. Therefore, we conducted an empirical study on graphs with weighted vertices. More specifically, this work conducts an experiment and analyzes characteristics of the final graph layouts, participants’ drawing processes and strategies and their drawing preferences. Results indicated that minimizing the number of edge crossings was still the most important aesthetic for participants, and that participants preferred the aesthetic of creating grid-like drawings in the condition with weighted vertices. Hence, this work suggested that aesthetics of minimizing number of edge crossings and creating grid-like patterns should be the main consideration for designing a graph drawing software application.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
Tax calculation will be finalised during checkout.
Apple Inc. (2020) iPad, Tech Spects. https://www.apple.com/ipad/. Accessed 17 Apr 2020
Bagler G (2008) Analysis of the airport network of India as a complex weighted network. Phys A 387(12):2972–2980
Barrat A, Barthelemy M, Pastor-Satorras R, Vespignani A (2004) The architecture of complex weighted networks. Proc Natl Acad Sci U S A 101(11):3747–3752
Batini C, Nardelli E, Tamassia R (1986) A layout algorithm for data flow diagrams. IEEE Trans Softw Eng 12(4):538–546
Centola D (2010) The spread of behavior in an online social network experiment. Science 329(5996):1194–1197
Chia S (1979) Social network analysis for organization. IEEE Commun Mag 4(4):507–519
Chia S (1992) The universal mobile telecommunication system. IEEE Commun Mag 30(12):54–62
di Battista G, Eades P, Tamassia R, Tollis IG (1994) Algorithms for drawing graphs: an annotated bibliography. J Comput Geom 4(5):235–282
Dwyer T, Lee B, Fisher D, Quinn KI, Isenberg P, Robertson G, North C (2009) A comparison of user-generated and automatic graph layouts. IEEE Trans Vis Comput Graph 15(6):961–968
Gange G, Stucky PJ, Marriott K (2011) Optimal k-level plannarization and crossing minimizing. In: Proceedings of symposium on graph drawing (GD2010), 2011. Volume 6502 of LNCS, pp 238–249
Guimera R, Mossa R, Turtschi A, Amaral LAN (2005) The worldwide air transportation network: anomalous centrality, community structure, and citys’ global roles. Proc Natl Acad Sci U S A 102(22):7794–7799
Huang W (2013) Establishing aesthetics based on human graph reading behavior: two eye tracking studies. Pers Ubiquitous Comput 17(1):93–105
Huang W, Hong SH, Eades P (2007) Effects of sociogram drawing conventions and edge crossings in social network visualization. J Graph Algorithms Appl 11(2):397–429
Huang W, Luo J, Bednarz T, Duh HBL (2018) Making graph visualization a user-centered process. J Vis Lang Comput 48:1–8
Kant G (1996) Drawing planar graphs using the canonical ordering. Algorithmica 16(1):4–32
Katzela I, Naghshineh M (1996) Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey. IEEE Pers Commun 3(3):10–31
Kobourov SG, Pupyrev S, Saket B (2014) Are crossings important for drawing large graphs? In: Proceedings of symposium on graph drawing (GD 2014), pp 234–245
Lee S, Park H (2007) Mining weighted frequent patterns from path traversals on weighted graph. Int J Comput Sci Netw Secur 7(4):140–144
Lin CC, Huang W, Liu WY, Tanizar S, Jhong SY (2016) Evaluating esthetics for user-sketched layouts of clustered graphs with known clustering information. J Vis Lang Comput 37:1–11
Lin CC, Huang W, Liu WY, Chen WL (2018) Evaluating aesthetics for user-sketched layouts of symmetric graphs. J Vis Lang Comput 48:123–133
Lin CC, Huang W, Liu WY, Chen CY (2020) Effects of individual difference on user-sketched layouts of vertex-weighted graphs. In: Proceedings of international conference in information visualization (IV20) (in press)
Marriott K, Purchase HC, Wybrow M, Goncu C (2012) Memorability of visual features in network diagrams. IEEE Trans Vis Comput Graph 18(12):2477–2485
Montis A, Barthelemy M, Chessa A, Vespignani A (2007) The structure of inter-urban traffic: a weighted network analysis. Environ Plan 34(5):905–924
Okamoto Y, Tatsu Y, Uno Y (2013) Exact and fixed-parameter algorithms for metro-line crossing minimization problems. In: Proceedings of symposium on graph drawing (GD 2013), 2013. Volume 8242 of LNCS, pp 520–521
Pach J (2013) The crossing-angle resolution in graph drawing. In: Pach J (ed) Thirty essays on geometric graph theory. Springer, New York, pp 167–184
Petrich R (2020) Display recorder. https://rpetri.ch/cydia/displayrecorder/. Accessed 17 Apr 2020
Purchase HC (1997) Which aesthetic has the greatest effect on human understanding? In: Proceedings of the 5th international symposium on graph drawing (GD97), 1997. Volume 1353 of LNCS, pp 248–261
Purchase HC (2000) Effective information visualization: a study of graph drawing aesthetics and algorithm. Interact Comput 13(2):147–162
Purchase HC (2014) A healthy critical attitude: revisiting the results of a graph drawing study. J Graph Algorithms Appl 18(2):281–311
Purchase HC, Cohen RF, James M (1995) Validating graph drawing aesthetics. In: Proceedings of symposium on graph drawing (GD95), 1995. Volume 1027 of LNCS, pp 435–446
Purchase HC, McGill M, Colpoys L, Carrington D (2001) Graph drawing aesthetics and the comprehension of UML class diagrams: an empirical study. In: Proceedings of 2001 Asia-Pacific symposium on information visualisation, 2001, Volume 9 of CRPIT, pp 129–137
Purchase HC, Plimmer B, Baker R, Pilcher C (2010) Graph drawing aesthetics in user-sketched graph layouts. In: Proceedings of 11th Australasian user interface conference, 2010. Volume 106 of CPRIT, pp 80–88
Purchase HC, Pilcher C, Plimmer B (2012) Graph drawing aesthetics—created by users, not algorithms. IEEE Trans Vis Comput Graph 18(1):80–88
Sosnowska J, Skibski O (2018) Path evaluation and centralities in weighted graphs: an axiomatic approach. In: Proceedings of the 27th international joint conference on artificial intelligence (IJCAI’18), 2018. AAAI Press, pp 3856–3862
The Omni Group (2020) OmniGraffle. http://www.omnigroup.com/omnigraffle/. Accessed 17 Apr 2020
van Ham F, Rogowitz B (2008) Perceptual organization in user-generated graph layouts. IEEE Trans Vis Comput Graph 14(6):1333–1339
Ware C, Purchase H, Colpoys L, McGill M (2002) Cognitive measurement of graph aesthetics. Inf Vis 1(2):103–110
Zhang Z, Chow M (2012) Convergence analysis of the incremental cost consensus algorithm under different communication network topologies in a small grid. IEEE Trans Power Syst 27(4):1761–1768
The authors thank the anonymous referees for comments that improved the content as well as the presentation of this paper. This work has been supported in part by Ministry of Science and Technology, Taiwan, under Grants MOST 106-2221-E-009-101-MY3 and MOST 108-2628-E-009-008-MY3, and the Ministry of Education, Taiwan, under the Higher Education Sprout Project.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Lin, CC., Huang, W., Liu, WY. et al. On aesthetics for user-sketched layouts of vertex-weighted graphs. J Vis 24, 157–171 (2021). https://doi.org/10.1007/s12650-020-00695-2
- Graph drawing aesthetics
- Weighted vertex
- User-sketched graph drawing
- Information visualization