Drawing graphs with nonuniform nodes using potential fields

Journal of Visual Languages and Computing

Volumn 20, Issue 6, 2009, Pages 385-402

  Lin, Chun Cheng ^a,b   Yen, Hsu Chun ^a,c   Chuang, Jen Hui ^d  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b NATIONAL KAOHSIUNG UNIVERSITY OF APPLIED SCIENCES   (Taiwan)

^c KAINAN UNIVERSITY   (Taiwan)

^d NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Graph drawing; Potential field

Indexed keywords

EID: 70350062219     PISSN: 1045926X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jvlc.2009.04.006     Document Type: Article

References (38)

1. K. Kaufmann, D. Wagner (Eds.), Drawing graphs: methods and models, in: Lecture Notes in Computer Science, vol. 2025, Springer, Berlin, 2001.
2. Eades P. A heuristic for graph drawing. Congress Numerantium 42 (1984) 149-160
3. Bertault F. A force-directed algorithm that preserves edge crossing properties. Graph Drawing 1999, Lecture Notes in Computer Science vol. 1731 (1999), Springer, Berlin 351-358
4. Lin C.-C., and Yen H.-C. A new force-directed graph drawing method based on edge-edge repulsion. IV 2005 (2005), IEEE CS Press 329-334
5. Fruchterman T., and Reingold E. Graph drawing by force-directed placement. Software-Practice and Experience 21 (1991) 1129-1164
6. Frick A., Ludwig A., and Mehldau H. A fast adaptive layout algorithm for undirected graphs. Graph Drawing '94, Lecture Notes in Computer Science vol. 894 (1995), Springer, Berlin 388-403
7. Davidson R., and Harel D. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics 15 (1996) 301-331
8. Kamada T., and Kawai S. An algorithm for drawing general undirected graphs. Information Processing Letters 31 (1989) 7-15
9. Sugiyama K., and Misue K. Graph drawing by the magnetic spring model. Journal of Visual Languages and Computing 6 (1995) 217-231
10. Hachul S., and Jünger M. Drawing large graphs with a potential-field-based multilevel algorithm. Graph Drawing 2004, Lecture Notes in Computer Science vol. 3383 (2004), Springer, Berlin 285-295
11. Harel D., and Koren Y. A fast multi-scale method for drawing large graphs. Journal of Graph Algorithms and Applications 6 3 (2002) 179-202
12. Brandenburg F.J., Himsolt M., and Rohrer C. An experimental comparison of force-directed and randomized graph drawing algorithms. Graph Drawing '95, Lecture Notes in Computer Science vol. 1027 (1995), Springer, Berlin 76-87
13. Eades P., and Lin X. Spring algorithms and symmetry. Theoretical Computer Science 240 2 (2000) 379-405
14. Harel D., and Koren Y. Drawing graphs with nonuniform vertices. AVI 2002 (2002), ACM Press, New York 157-166
15. Huang X., and Lai W. Force-transfer: a new approach to removing overlapping nodes in graph layout. 25th Australasian Computer Science Conference, CRPIT vol. 16 (2003), Australian Computer Society 349-358
16. Eichelberger H. SugiBib. Graph Drawing 2001, Lecture Notes in Computer Science vol. 2265 (2002), Springer, Berlin 467-468
17. Gutwenger C., Jünger M., Klein K., Kupke J., Leipert S., and Mutzel P. A new approach for visualizing UML class diagrams. SOFTVIS 2003 (2003), ACM Press, New York 179-188
18. Chuang J.-H. Potential-based modeling of three-dimensional workspace for obstacle avoidance. IEEE Transactions on Robotics and Automation 14 5 (1998) 778-785
19. Chuang J.-H., and Ahuja N. An analytically tractable potential field model of free space and its application in obstacle avoidance. IEEE Transactions on System, Man, and Cybernetics-Part B: Cybernetics 28 5 (1998) 729-736
20. Miller F.B.M. An algorithm for drawing compound graphs. Graph Drawing '99, Lecture Notes in Computer Science vol. 1731 (1999), Springer, Berlin 197-204
21. Dogrusöz U., Giral E., Cetintas A., Civril A., and Demir E. A compound graph layout algorithm for biological pathways. Graph Drawing 2004, Lecture Notes in Computer Science vol. 3383 (2004), Springer, Berlin 442-447
22. Biedl T.C., and Kaufmann M. Area-efficient static and incremental graph drawings. ESA'97, Lecture Notes in Computer Science vol. 1284 (1997), Springer, Berlin 37-52
23. Feng Q., Cohen R., and Eades P. Planarity for clustered graphs. ESA'95, Lecture Notes in Computer Science vol. 979 (1995), Springer, Berlin 213-226
24. Q. Feng, Algorithms for drawing clustered graphs, Ph.D. Thesis, University of Newcastle, Australia, 1997.
25. Eades P., and Huang M.L. Navigating clustered graphs using force-directed methods. Journal of Graph Algorithms and Applications 4 3 (2000) 157-181
26. Tutte W.T. Convex representations of graphs. Proceedings of the London Mathematical Society 10 (1960) 304-320
27. Tutte W.T. How to draw a graph. Proceedings of the London Mathematical Society 13 (1963) 743-768
28. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
29. Gansner E., and North S. Improved force-directed layouts. Graph Drawing '98, Lecture Notes in Computer Science vol. 1547 (1998), Springer, Berlin 364-373
30. Dwyer T., Marriott K., and Stuckey P.J. Fast node overlap removal. Graph Drawing 2005, Lecture Notes in Computer Science vol. 3843 (2005), Springer, Berlin 153-164
31. Purchase H. Which aesthetics has the greatest effect on human understanding. Graph Drawing '97, Lecture Notes in Computer Science vol. 1353 (1997), Springer, Berlin 248-261
32. Purchase H., Allder J.-A., and Carrington D. Graph layout aesthetics in UML diagrams: user preferences. Journal of Graph Algorithms and Applications 6 3 (2002) 255-279
33. Rumbaugh J., Jacobson J., and Booch G. The Unified Modeling Language Reference Manual (1998), Addison-Wesley, Essex, UK
34. Giese H., and Wirtz G. Visual modeling of object-oriented distributed systems. Journal of Visual Languages and Computing 12 (2001) 183-202
35. Brauer W., Reisig W., and Rozenberg G. Petri nets: central models (part I)/applications (part II). Lecture Notes in Computer Science vols. 254/255 (1987), Springer, Berlin
36. Ahmed A., et al. GEOME: GEOmetry for maximum insight. Graph Drawing 2005, Lecture Notes in Computer Science vol. 3843 (2005), Springer, Berlin 468-479
37. Dwyer T. Extending the WilmaScope 3D graph visualization system-software demonstration. Proceedings of Asia Pacific Symposium on Information Visualisation 2005 (APVIS2005), CRPIT vol. 45 (2005) 35-42
38. Henry N., Fekete J.-D., and McGuffin M.J. NodeTrix: a hybrid visualization of social networks. IEEE Transactions on Visualization and Computer Graphics 13 6 (2007)