Improving the Quality of Clustered Graph Drawing through a Dummy Element Approach
作者： Jie Hua , Mao Lin Huang
DOI: 10.1109/CGIV.2013.23
关键词:
摘要: Clustered graphs have been widely consisted in Graph Drawing to overcome the problem of drawing large (or huge) with thousands, or perhaps millions nodes. Force-directed algorithm is one available approaches draw such good layouts. However, force directed methods are often produce very different layout outcomes based on clustering algorithms that greatly affect quality final result. In this paper, we propose a 'dummy element' approach for clustered by using traditional force-directed algorithm. Our attempts maximize satisfaction aesthetics graph drawing. The experimental results shown our new method can reduce side effects choosing and improve
sci-hub.se 参考文章(16)
François Bertault, A Force-Directed Algorithm that Preserves Edge Crossing Properties graph drawing. pp. 351- 358 ,(1999) , 10.1007/3-540-46648-7_36
HELEN C. PURCHASE, Performance of Layout Algorithms: Comprehension, not Computation Journal of Visual Languages and Computing. ,vol. 9, pp. 647- 657 ,(1998) , 10.1006/JVLC.1998.0093
Jie Hua, Mao Lin Huang, Weidong Huang, Junhu Wang, Quang Vinh Nguyen, Force-directed Graph Visualization with Pre-positioning - Improving Convergence Time and Quality of Layout 2012 16th International Conference on Information Visualisation. pp. 124- 129 ,(2012) , 10.1109/IV.2012.31
Maolin Huang, Weidong Huang, Chun-Cheng Lin, Evaluating force-directed algorithms with a new framework acm symposium on applied computing. pp. 1030- 1032 ,(2012) , 10.1145/2245276.2245475
Weidong Huang, Peter Eades, Seok-Hee Hong, Chun-Cheng Lin, Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics symposium on visual languages and human-centric computing. pp. 176- 183 ,(2010) , 10.1109/VLHCC.2010.32
Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu, An experimental comparison of four graph drawing algorithms Computational Geometry: Theory and Applications. ,vol. 7, pp. 303- 325 ,(1997) , 10.1016/S0925-7721(96)00005-3
MAO LIN HUANG, PETER EADES, JUNHU WANG, On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm Journal of Visual Languages and Computing. ,vol. 9, pp. 623- 645 ,(1998) , 10.1006/JVLC.1998.0094
Quang Vinh Nguyen, Mao Lin Huang, EncCon: an approach to constructing interactive visualization of large hierarchical data Information Visualization. ,vol. 4, pp. 1- 21 ,(2005) , 10.1057/PALGRAVE.IVS.9500087
Mao Lin Huang, Peter Eades, Robert F. Cohen, WebOFDAV — navigating and visualizing the Web on-line with animated context swapping the web conference. ,vol. 30, pp. 638- 642 ,(1998) , 10.1016/S0169-7552(98)00054-3
Xiaodi Huang, Wei Lai, Clustering graphs for visualization via node similarities Journal of Visual Languages & Computing. ,vol. 17, pp. 225- 253 ,(2006) , 10.1016/J.JVLC.2005.10.003