Improving force-directed graph drawings by making compromises between aesthetics

Proceedings - 2010 IEEE Symposium on Visual Languages and Human-Centric Computing, VL/HCC 2010

Volumn , Issue , 2010, Pages 176-183

  Huang, Weidong ^a   Eadesy, Peter ^b   Hongy, Seok Hee ^b   Linz, Chun Cheng ^c  

^a CSIRO   (Australia)

^b UNIVERSITY OF SYDNEY   (Australia)

^c UNIVERSITY OF TAIPEI   (Taiwan)

Author keywords

Aesthetic criteria; Effectiveness; Evaluation; Force directed algorithms; Graph drawing

Indexed keywords

AESTHETIC CRITERIA; EFFECTIVENESS; EVALUATION; FORCE-DIRECTED ALGORITHMS; GRAPH DRAWING;

DRAWING (GRAPHICS); GRAPH THEORY;

ALGORITHMS;

EID: 79952062770     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VLHCC.2010.32     Document Type: Conference Paper

References (25)

1. Bertault, F. (1999) A force-directed algorithm that preserves edge crossing properties. In Proc. the 7th International Symposium on Graph Drawing (GD'99), LNCS vol. 1731, Springer, 351-358.
2. Brandenburg, F., Himsholt, M. and Rohrer, C. (1996) An experimental comparison of force-directed and randomized graph drawing algorithms. In Proc. the International Symposium on Graph Drawing (GD'95). LNCS vol. 1027, Springer-Verlag, 76-87.
3. Brandes, U. (2001) Drawing on Physical Analogies. In Michael Kaufmann and Dorothea Wagner (Eds.): Drawing Graphs: Methods and Models. LNCS Tutorial 2025, Springer-Verlag, 71-86.
4. Brandes, U. and Wagner, D. (2001) Using Graph Layout to Visualize Train Interconnection Data. Journal of Graph Algorithms and Applications, 4(3):135-155.
5. Davidson, R. and Harel, D. (1996) Drawing graphs nicely using simulated annealing. ACM Trans. Graph. 15, 4 (Oct. 1996), 301-331.
6. Di Battista, G., Eades, P., Tamassia, R. and Tollis, I. (1998) Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, Upper Saddle River, New Jersey.
7. Dwyer, T., Marriott, K. and Wybrow, M. (2007) Integrating edge routing into force-directed layout. In Proc. the 14th International Symposium on Graph Drawing (GD'06), LNCS vol. 4372, Springer, 8-19.
8. Eades, P. (1984) A Heuristic for Graph Drawing. Congressus Numerantium, 42: 149-160.
9. Finkel, B. and Tamassia, R. (2004) Curvilinear graph drawing using the force-directed method. In Proc. the 12th International Symposium on Graph Drawing (GD'04). LNCS vol. 3383, Springer, 448-453. (Pubitemid 41239588)
10. Fruchterman, T. and Reingold, E.M. (1991) Graph Drawing by Force-Directed Placement. Software - Practice and Experience, 21: 1129-1164.
11. GDT (2009) http://www.dia.uniroma3.it/~gdt/gdt4/test suite.php
12. Hong, S.-H., Merrick, D. and Nascimento, H. (2006) The Metro Map Layout Problem. Journal of Visual Language and Computing, 17(3): 203-224.
13. Huang, M.L., Eades, P., Wang, J. (1998) On-line Animated Visualization of Huge Graphs Using a Modified Spring Algorithm. Journal of Visual Language and Computing, 9(6): 623-645. (Pubitemid 128179507)
14. Huang, W. (2007) Using eye tracking to investigate graph layout effects. In Proc. Asia-Pacific Symposium on Information Visualisation, 97-100.
15. Huang, W., Hong, S.-H. and Eades, P. (2008) Effects of crossing angles. In Proc. IEEE Pacific Visualization Symposium 2008, 41-46.
16. Huang, W., Eades, P. and Hong, S.-H. (2009) Measuring Effectiveness of Graph Visualizations: A Cognitive Load Perspective. Information Visualization, 8(3): 139-152.
17. Huang, W., Nguyen, Q., Eades, P. and Hong, S.-H. (2010) Large crossing angle: From aesthetics to algorithms. Submitted to 18th International Symposium on Graph Drawing.
18. Huang, W., Lin, C.-C., Eades, P. and Hong, S.-H. (2010) A force-directed method for improving angular resolution. In preparation.
19. Kumar, P. and Zhang, K. (2009) Visualization of clustered directed acyclic graphs with node interleaving. In Proc. the 2009 ACM Symposium on Applied Computing (SAC'09), 1800-1805.
20. Purchase, H.C., Cohen, R.F. and James, M. (1996) Validating graph drawing aesthetics. In Proc. the 4th International Symposium on Graph Drawing (GD'96), Springer, 435-446. (Pubitemid 126025111)
21. Purchase, H.C., Carrington, D., and Allder, J. (2002) Empirical Evaluation of Aesthetics-based Graph Layout. Empirical Softw. Engg., 7(3): 233-255.
22. Purchase, H.C. (1998) Performance of layout algorithms: Comprehension, not computation. Journal of Visual Languages and Computing, 9: 647-657.
23. Tunkelang, D. (1994) A Practical Approach to Drawing Undirected Graphs. Technical Report, UMI Order Number: CS-94-161. Carnegie Mellon University.
24. Ware, C. and Bobrow, R. (2004) Motion to support rapid interactive queries on Node-Link diagrams. ACM Transactions on Applied Perception. 1(1): 3-18.
25. Ware, C. and Mitchell, P. (2008) Visualizing Graphs in Three Dimensions. ACM Transactions on Applied Perception. 5(1):1-15.