{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:14:15Z","timestamp":1740158055848,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:00:00Z","timestamp":1600473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:00:00Z","timestamp":1600473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010002","name":"Ministry of Education","doi-asserted-by":"publisher","award":["Higher Education Sprout Project"],"award-info":[{"award-number":["Higher Education Sprout Project"]}],"id":[{"id":"10.13039\/100010002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 106-2221-E-009-101-MY3"],"award-info":[{"award-number":["MOST 106-2221-E-009-101-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 108-2628-E-009-008-MY3"],"award-info":[{"award-number":["MOST 108-2628-E-009-008-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Vis"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s12650-020-00695-2","type":"journal-article","created":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T09:02:44Z","timestamp":1600506164000},"page":"157-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On aesthetics for user-sketched layouts of vertex-weighted graphs"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9073-593X","authenticated-orcid":false,"given":"Chun-Cheng","family":"Lin","sequence":"first","affiliation":[]},{"given":"Weidong","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Wan-Yu","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chang-Yu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"695_CR1","unstructured":"Apple Inc. (2020) iPad, Tech Spects. https:\/\/www.apple.com\/ipad\/. Accessed 17 Apr 2020"},{"issue":"12","key":"695_CR2","doi-asserted-by":"publisher","first-page":"2972","DOI":"10.1016\/j.physa.2008.01.077","volume":"387","author":"G Bagler","year":"2008","unstructured":"Bagler G (2008) Analysis of the airport network of India as a complex weighted network. Phys A 387(12):2972\u20132980","journal-title":"Phys A"},{"issue":"11","key":"695_CR3","doi-asserted-by":"publisher","first-page":"3747","DOI":"10.1073\/pnas.0400087101","volume":"101","author":"A Barrat","year":"2004","unstructured":"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\u20133752","journal-title":"Proc Natl Acad Sci U S A"},{"issue":"4","key":"695_CR4","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"12","author":"C Batini","year":"1986","unstructured":"Batini C, Nardelli E, Tamassia R (1986) A layout algorithm for data flow diagrams. IEEE Trans Softw Eng 12(4):538\u2013546","journal-title":"IEEE Trans Softw Eng"},{"issue":"5996","key":"695_CR5","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1126\/science.1185231","volume":"329","author":"D Centola","year":"2010","unstructured":"Centola D (2010) The spread of behavior in an online social network experiment. Science 329(5996):1194\u20131197","journal-title":"Science"},{"issue":"4","key":"695_CR6","first-page":"507","volume":"4","author":"S Chia","year":"1979","unstructured":"Chia S (1979) Social network analysis for organization. IEEE Commun Mag 4(4):507\u2013519","journal-title":"IEEE Commun Mag"},{"issue":"12","key":"695_CR7","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/35.210356","volume":"30","author":"S Chia","year":"1992","unstructured":"Chia S (1992) The universal mobile telecommunication system. IEEE Commun Mag 30(12):54\u201362","journal-title":"IEEE Commun Mag"},{"issue":"5","key":"695_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G di Battista","year":"1994","unstructured":"di Battista G, Eades P, Tamassia R, Tollis IG (1994) Algorithms for drawing graphs: an annotated bibliography. J Comput Geom 4(5):235\u2013282","journal-title":"J Comput Geom"},{"issue":"6","key":"695_CR9","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TVCG.2009.109","volume":"15","author":"T Dwyer","year":"2009","unstructured":"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\u00a015(6):961\u2013968","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"695_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013249","DOI":"10.1007\/978-3-642-18469-7_22"},{"issue":"22","key":"695_CR11","doi-asserted-by":"publisher","first-page":"7794","DOI":"10.1073\/pnas.0407994102","volume":"102","author":"R Guimera","year":"2005","unstructured":"Guimera R, Mossa R, Turtschi A, Amaral LAN (2005) The worldwide air transportation network: anomalous centrality, community structure, and citys\u2019 global roles. Proc Natl Acad Sci U S A 102(22):7794\u20137799","journal-title":"Proc Natl Acad Sci U S A"},{"issue":"1","key":"695_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00779-011-0473-2","volume":"17","author":"W Huang","year":"2013","unstructured":"Huang W (2013) Establishing aesthetics based on human graph reading behavior: two eye tracking studies. Pers Ubiquitous Comput 17(1):93\u2013105","journal-title":"Pers Ubiquitous Comput"},{"issue":"2","key":"695_CR13","doi-asserted-by":"publisher","first-page":"397","DOI":"10.7155\/jgaa.00152","volume":"11","author":"W Huang","year":"2007","unstructured":"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\u2013429","journal-title":"J Graph Algorithms Appl"},{"key":"695_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jvlc.2018.07.001","volume":"48","author":"W Huang","year":"2018","unstructured":"Huang W, Luo J, Bednarz T, Duh HBL (2018) Making graph visualization a user-centered process. J Vis Lang Comput 48:1\u20138","journal-title":"J Vis Lang Comput"},{"issue":"1","key":"695_CR15","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G Kant","year":"1996","unstructured":"Kant G (1996) Drawing planar graphs using the canonical ordering. Algorithmica 16(1):4\u201332","journal-title":"Algorithmica"},{"issue":"3","key":"695_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/98.511762","volume":"3","author":"I Katzela","year":"1996","unstructured":"Katzela I, Naghshineh M (1996) Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey. IEEE Pers Commun 3(3):10\u201331","journal-title":"IEEE Pers Commun"},{"key":"695_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013245","DOI":"10.1007\/978-3-662-45803-7_20"},{"issue":"4","key":"695_CR18","first-page":"140","volume":"7","author":"S Lee","year":"2007","unstructured":"Lee S, Park H (2007) Mining weighted frequent patterns from path traversals on weighted graph. Int J Comput Sci Netw Secur 7(4):140\u2013144","journal-title":"Int J Comput Sci Netw Secur"},{"key":"695_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jvlc.2016.09.001","volume":"37","author":"CC Lin","year":"2016","unstructured":"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\u201311","journal-title":"J Vis Lang Comput"},{"key":"695_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jvlc.2018.08.004","volume":"48","author":"CC Lin","year":"2018","unstructured":"Lin CC, Huang W, Liu WY, Chen WL (2018) Evaluating aesthetics for user-sketched layouts of symmetric graphs. J Vis Lang Comput 48:123\u2013133","journal-title":"J Vis Lang Comput"},{"key":"695_CR21","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/IV51561.2020.00017"},{"issue":"12","key":"695_CR22","doi-asserted-by":"publisher","first-page":"2477","DOI":"10.1109\/TVCG.2012.245","volume":"18","author":"K Marriott","year":"2012","unstructured":"Marriott K, Purchase HC, Wybrow M, Goncu C (2012) Memorability of visual features in network diagrams. IEEE Trans Vis Comput Graph\u00a018(12):2477\u20132485","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"5","key":"695_CR23","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1068\/b32128","volume":"34","author":"A Montis","year":"2007","unstructured":"Montis A, Barthelemy M, Chessa A, Vespignani A (2007) The structure of inter-urban traffic: a weighted network analysis. Environ Plan 34(5):905\u2013924","journal-title":"Environ Plan"},{"key":"695_CR24","unstructured":"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\u2013521"},{"key":"695_CR25","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-1-4614-0110-0","volume-title":"Thirty essays on geometric graph theory","author":"J Pach","year":"2013","unstructured":"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\u2013184"},{"key":"695_CR26","unstructured":"Petrich R (2020) Display recorder. https:\/\/rpetri.ch\/cydia\/displayrecorder\/. Accessed 17 Apr 2020"},{"key":"695_CR27","doi-asserted-by":"crossref","unstructured":"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\u2013261","DOI":"10.1007\/3-540-63938-1_67"},{"issue":"2","key":"695_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"HC Purchase","year":"2000","unstructured":"Purchase HC (2000) Effective information visualization: a study of graph drawing aesthetics and algorithm. Interact Comput 13(2):147\u2013162","journal-title":"Interact Comput"},{"issue":"2","key":"695_CR29","doi-asserted-by":"publisher","first-page":"281","DOI":"10.7155\/jgaa.00323","volume":"18","author":"HC Purchase","year":"2014","unstructured":"Purchase HC (2014) A healthy critical attitude: revisiting the results of a graph drawing study. J Graph Algorithms Appl 18(2):281\u2013311","journal-title":"J Graph Algorithms Appl"},{"key":"695_CR30","doi-asserted-by":"crossref","unstructured":"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\u2013446","DOI":"10.1007\/BFb0021827"},{"key":"695_CR31","unstructured":"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\u2013137"},{"key":"695_CR32","unstructured":"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\u201388"},{"issue":"1","key":"695_CR33","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/TVCG.2010.269","volume":"18","author":"HC Purchase","year":"2012","unstructured":"Purchase HC, Pilcher C, Plimmer B (2012) Graph drawing aesthetics\u2014created by users, not algorithms. IEEE Trans Vis Comput Graph\u00a018(1):80\u201388","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"695_CR34","doi-asserted-by":"crossref","unstructured":"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\u201918), 2018. AAAI Press, pp 3856\u20133862","DOI":"10.24963\/ijcai.2018\/536"},{"key":"695_CR35","unstructured":"The Omni Group (2020) OmniGraffle. http:\/\/www.omnigroup.com\/omnigraffle\/. Accessed 17 Apr 2020"},{"issue":"6","key":"695_CR36","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TVCG.2008.155","volume":"14","author":"F van Ham","year":"2008","unstructured":"van Ham F, Rogowitz B (2008) Perceptual organization in user-generated graph layouts. IEEE Trans Vis Comput Graph\u00a014(6):1333\u20131339","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"2","key":"695_CR37","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C Ware","year":"2002","unstructured":"Ware C, Purchase H, Colpoys L, McGill M (2002) Cognitive measurement of graph aesthetics. Inf Vis 1(2):103\u2013110","journal-title":"Inf Vis"},{"issue":"4","key":"695_CR38","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1109\/TPWRS.2012.2188912","volume":"27","author":"Z Zhang","year":"2012","unstructured":"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\u20131768","journal-title":"IEEE Trans Power Syst"}],"container-title":["Journal of Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-020-00695-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12650-020-00695-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-020-00695-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T00:18:42Z","timestamp":1632010722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12650-020-00695-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,19]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["695"],"URL":"https:\/\/doi.org\/10.1007\/s12650-020-00695-2","relation":{},"ISSN":["1343-8875","1875-8975"],"issn-type":[{"type":"print","value":"1343-8875"},{"type":"electronic","value":"1875-8975"}],"subject":[],"published":{"date-parts":[[2020,9,19]]},"assertion":[{"value":"1 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}