Skip to main content
Top
Published in: Journal of Visualization 1/2021

19-09-2020 | Regular Paper

On aesthetics for user-sketched layouts of vertex-weighted graphs

Authors: Chun-Cheng Lin, Weidong Huang, Wan-Yu Liu, Chang-Yu Chen

Published in: Journal of Visualization | Issue 1/2021

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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.

Graphic abstract

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference Bagler G (2008) Analysis of the airport network of India as a complex weighted network. Phys A 387(12):2972–2980CrossRef Bagler G (2008) Analysis of the airport network of India as a complex weighted network. Phys A 387(12):2972–2980CrossRef
go back to reference 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–3752CrossRef 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–3752CrossRef
go back to reference Batini C, Nardelli E, Tamassia R (1986) A layout algorithm for data flow diagrams. IEEE Trans Softw Eng 12(4):538–546CrossRef Batini C, Nardelli E, Tamassia R (1986) A layout algorithm for data flow diagrams. IEEE Trans Softw Eng 12(4):538–546CrossRef
go back to reference Centola D (2010) The spread of behavior in an online social network experiment. Science 329(5996):1194–1197CrossRef Centola D (2010) The spread of behavior in an online social network experiment. Science 329(5996):1194–1197CrossRef
go back to reference Chia S (1979) Social network analysis for organization. IEEE Commun Mag 4(4):507–519 Chia S (1979) Social network analysis for organization. IEEE Commun Mag 4(4):507–519
go back to reference Chia S (1992) The universal mobile telecommunication system. IEEE Commun Mag 30(12):54–62CrossRef Chia S (1992) The universal mobile telecommunication system. IEEE Commun Mag 30(12):54–62CrossRef
go back to reference di Battista G, Eades P, Tamassia R, Tollis IG (1994) Algorithms for drawing graphs: an annotated bibliography. J Comput Geom 4(5):235–282MathSciNetCrossRef di Battista G, Eades P, Tamassia R, Tollis IG (1994) Algorithms for drawing graphs: an annotated bibliography. J Comput Geom 4(5):235–282MathSciNetCrossRef
go back to reference 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–968CrossRef 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–968CrossRef
go back to reference 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 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
go back to reference 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–7799CrossRef 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–7799CrossRef
go back to reference Huang W (2013) Establishing aesthetics based on human graph reading behavior: two eye tracking studies. Pers Ubiquitous Comput 17(1):93–105CrossRef Huang W (2013) Establishing aesthetics based on human graph reading behavior: two eye tracking studies. Pers Ubiquitous Comput 17(1):93–105CrossRef
go back to reference 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–429MathSciNetCrossRef 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–429MathSciNetCrossRef
go back to reference Huang W, Luo J, Bednarz T, Duh HBL (2018) Making graph visualization a user-centered process. J Vis Lang Comput 48:1–8CrossRef Huang W, Luo J, Bednarz T, Duh HBL (2018) Making graph visualization a user-centered process. J Vis Lang Comput 48:1–8CrossRef
go back to reference Katzela I, Naghshineh M (1996) Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey. IEEE Pers Commun 3(3):10–31CrossRef Katzela I, Naghshineh M (1996) Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey. IEEE Pers Commun 3(3):10–31CrossRef
go back to reference 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 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
go back to reference 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 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
go back to reference 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–11CrossRef 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–11CrossRef
go back to reference Lin CC, Huang W, Liu WY, Chen WL (2018) Evaluating aesthetics for user-sketched layouts of symmetric graphs. J Vis Lang Comput 48:123–133CrossRef Lin CC, Huang W, Liu WY, Chen WL (2018) Evaluating aesthetics for user-sketched layouts of symmetric graphs. J Vis Lang Comput 48:123–133CrossRef
go back to reference 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) 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)
go back to reference Marriott K, Purchase HC, Wybrow M, Goncu C (2012) Memorability of visual features in network diagrams. IEEE Trans Vis Comput Graph 18(12):2477–2485CrossRef Marriott K, Purchase HC, Wybrow M, Goncu C (2012) Memorability of visual features in network diagrams. IEEE Trans Vis Comput Graph 18(12):2477–2485CrossRef
go back to reference Montis A, Barthelemy M, Chessa A, Vespignani A (2007) The structure of inter-urban traffic: a weighted network analysis. Environ Plan 34(5):905–924CrossRef Montis A, Barthelemy M, Chessa A, Vespignani A (2007) The structure of inter-urban traffic: a weighted network analysis. Environ Plan 34(5):905–924CrossRef
go back to reference 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 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
go back to reference 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–184CrossRef 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–184CrossRef
go back to reference 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 (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
go back to reference Purchase HC (2000) Effective information visualization: a study of graph drawing aesthetics and algorithm. Interact Comput 13(2):147–162CrossRef Purchase HC (2000) Effective information visualization: a study of graph drawing aesthetics and algorithm. Interact Comput 13(2):147–162CrossRef
go back to reference Purchase HC (2014) A healthy critical attitude: revisiting the results of a graph drawing study. J Graph Algorithms Appl 18(2):281–311MathSciNetCrossRef Purchase HC (2014) A healthy critical attitude: revisiting the results of a graph drawing study. J Graph Algorithms Appl 18(2):281–311MathSciNetCrossRef
go back to reference 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, 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
go back to reference 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, 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
go back to reference 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, 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
go back to reference Purchase HC, Pilcher C, Plimmer B (2012) Graph drawing aesthetics—created by users, not algorithms. IEEE Trans Vis Comput Graph 18(1):80–88CrossRef Purchase HC, Pilcher C, Plimmer B (2012) Graph drawing aesthetics—created by users, not algorithms. IEEE Trans Vis Comput Graph 18(1):80–88CrossRef
go back to reference 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 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
go back to reference van Ham F, Rogowitz B (2008) Perceptual organization in user-generated graph layouts. IEEE Trans Vis Comput Graph 14(6):1333–1339CrossRef van Ham F, Rogowitz B (2008) Perceptual organization in user-generated graph layouts. IEEE Trans Vis Comput Graph 14(6):1333–1339CrossRef
go back to reference Ware C, Purchase H, Colpoys L, McGill M (2002) Cognitive measurement of graph aesthetics. Inf Vis 1(2):103–110CrossRef Ware C, Purchase H, Colpoys L, McGill M (2002) Cognitive measurement of graph aesthetics. Inf Vis 1(2):103–110CrossRef
go back to reference 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–1768CrossRef 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–1768CrossRef
Metadata
Title
On aesthetics for user-sketched layouts of vertex-weighted graphs
Authors
Chun-Cheng Lin
Weidong Huang
Wan-Yu Liu
Chang-Yu Chen
Publication date
19-09-2020
Publisher
Springer Berlin Heidelberg
Published in
Journal of Visualization / Issue 1/2021
Print ISSN: 1343-8875
Electronic ISSN: 1875-8975
DOI
https://doi.org/10.1007/s12650-020-00695-2

Other articles of this Issue 1/2021

Journal of Visualization 1/2021 Go to the issue

Premium Partner