A new force-directed graph drawing method based on edge-edge repulsion

Journal of Visual Languages and Computing

Volumn 23, Issue 1, 2012, Pages 29-42

  Lin, Chun Cheng ^a   Yen, Hsu Chun ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Angular resolution; Force directed method; Potential field

Indexed keywords

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

References (28)

1. Bertault F. A force-directed algorithm that preserves edge-crossing properties. Information Processing Letters 2000, 74(1-2):7-13.
2. Chuang J.-H., Ahuja N. An analytically tractable potential field model of free space and its application in obstacle avoidance. IEEE Transactions on System, Man, and Cybernetics 1998, 28(5):729-736.
3. Davidson R., Harel D. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics 1996, 15:301-331.
4. Eades P. A heuristic for graph drawing. Congress Numerantium 1984, 42:149-160.
5. Eades P., Lin X. Spring algorithms and symmetry. Theoretical Computer Science 2000, 240(2):379-405.
6. Formann M., Haralambides J., Kaufmann M., Leighton F.T., Simvonis A., Welzl E., Woeginger G. Drawing graphs in the plane with high resolution. SIAM Journal on Computing 1993, 22(5):1035-1052.
7. Frick A., Ludwig A., Mehldau H. A fast adaptive layout algorithm for undirected graphs. Graph Drawing '94, Lecture Notes in Computer Science 1995, vol. 894:388-403. Springer.
8. Frishman Y., Tal A. Multi-level graph layout on the GPU. IEEE Transactions on Visualization and Computer Graphics 2007, 13(6):1310-1317.
9. Frishman Y., Tal A. MOVIS: a system for visualizing distributed mobile object environments. Journal of Visual Languages and Computing 2008, 19(3):303-320.
10. Frishman Y., Tal A. Online dynamic graph drawing. IEEE Transactions on Visualization and Computer Graphics 2008, 14(4):727-740.
11. Fruchterman T., Reingold E. Graph drawing by force-directed placement. Software-Practice and Experience 1991, 21:1129-1164.
12. Gajer P., Goodrich M.T., Kobourov S.G. A multi-dimensional approach to force-directed layouts of large graphs. Computational Geometry: Theory and Applications 2004, 29(1):3-18.
13. Hachul S., Jünger M. Drawing large graphs with a potential-field-based multilevel algorithm. Graph Drawing 2004, Lecture Notes in Computer Science 2005, vol. 3383:285-295. Springer.
14. Hachul S., Jünger M. Large-graph layout algorithms at work: an experimental study. Journal of Graph Algorithms and Applications 2007, 11(2):345-369.
15. Harel D., Koren Y. A fast multi-scale method for drawing large graphs. Journal of Graph Algorithms and Applications 2002, 6(3):179-202.
16. Hong S.-H., Merrick D., do Nascimento H.A. Automatic visualisation of metro maps. Journal of Visual Languages and Computing 2008, 19(3):303-320.
17. Huang M., Eades P., Wang J. On-line animated visualization of huge graphs using a modified spring algorithm. Journal of Visual Languages and Computing 1998, 9(6):345-623.
18. Kamada T., Kawai S. An algorithm for drawing general undirected graphs. Information Processing Letters 1989, 31:7-15.
19. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science 1983, 220:671-680.
20. Kobourov S., Wampler K. Non-Euclidean spring embedders. IEEE Transactions on Visualization and Computer Graphics 2005, 11(6):757-767.
21. Kumar G., Garland M. Visual exploration of complex time-varying graphs. IEEE Transactions on Visualization and Computer Graphics 2006, 12(5):805-812.
22. Lin C.-C., Yen H.-C., Chuang J.-H. Drawing graphs with nonuniform nodes using potential fields. Journal of Visual Languages and Computing 2009, 20(6):385-402.
23. Misue K., Eades P., Lai W., Sugiyama K. Layout adjustment and the mental map. Journal of Visual Languages and Computing 1995, 6(2):183-210.
24. Purchase H.C. Metrics for graph drawing aesthetics. Journal of Visual Languages and Computing 2002, 13(5):501-516.
25. Sugiyama K., Misue K. Graph drawing by the magnetic spring model. Journal of Visual Languages and Computing 1995, 6:217-231.
26. Tutte W.T. Convex representations of graphs. Proceedings of the London Mathematical Society 1960, 10:304-320.
27. Tutte W.T. How to draw a graph. Proceedings of the London Mathematical Society 1963, 13:743-768.
28. Walshaw C. A multilevel algorithm for force-directed graph-drawing. Journal of Graph Algorithms and Applications 2003, 7(3):253-285.