Abstract
Force-directed algorithm is one of the most commonly used methods for visualization of 2D graphs. These algorithms can be applied to a plethora of applications such as data visualization, social network analysis, crypto-currency transactions, and wireless sensor networks. Due to their effectiveness in visualization of topological data, various force-directed algorithms for 2D graphs were proposed in recent years. Although force-directed algorithms for 2D graphs were extensively investigated in research community, the algorithms for 3D graph visualization were rarely reported in the literature. In this paper, we propose four novel clustering-based force-directed (CFD) algorithms for visualization of 3D graphs. By using clustering algorithms, we divide a large graph into many smaller graphs so that they can be effectively processed by force-directed algorithms. In addition, weights are also introduced to further enhance the calculation for clusters. The proposed CFD algorithms are tested on 3 datasets with varying numbers of nodes. The experimental results show that proposed algorithms can significantly reduce edge crossings in visualization of large 3D graphs. The results also reveal that CFD algorithms can also reduce Kamada and Kawai energy and standardized variance of edge lengths in 3D graph visualization.
Similar content being viewed by others
References
Freeman LC (2012) Methods of social network visualization. In: Meyers RA (ed) Computational complexity: theory, techniques, and applications. Springer, New York, pp 2981–2998
Junger M, Mutzel P (2003) Graph drawing software. Springer, Berlin
Quinn N, Breuer M (1979) A forced directed component placement procedure for printed circuit boards. IEEE Trans Circuits Syst 26(6):377–388
Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exp 21:1129–1164
Eades P (1984) A heuristic for graph drawing. Congr Numerantium 42:149–160
Kamada T, Kawai S (1989) An aalgorithm for drawing general undirected graphs. Inf Process Lett 31(1):7–15
Brandes U, Indlekofer N, Mader M (2012) Visualization methods for longitudinal social networks and stochastic actor-oriented modeling. Soc Netw 34(3):291–308
Brasch S, Fuellen G, Linsen L (2012) VENLO: interactive visual exploration of aligned biological networks and their evolution. Springer, Berlin, pp 229–247
Yang J, Leskovec J (2013) Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, Rome, Italy, ACM, pp 587–596
Dongen SMV (2001) Graph clustering by flow simulation. Utrecht University, Utrecht
Frick A, Ludwig A, Mehldau H (1995) A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration). Springer, Berlin, pp 388–403
Bannister MJ, Eppstein D, Goodrich MT, Trott L (2013) Force-directed graph drawing using social gravity and scaling. In: Didimo W, Patrignani M (eds) Graph drawing: 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012, Revised Selected Papers, Springer, Berlin, pp 414–425
Davidson R, Harel D (1996) Drawing graphs nicely using simulated annealing. ACM Trans Graph 15:301–331
Jacomy M, Venturini T, Heymann S, Bastian M (2014) ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. Plos One 9(6):e98679. https://doi.org/10.1371/journal.pone.0098679
Noack A (2004) An energy model for visual graph clustering. In: Graph drawing: 11th international symposium, GD 2003 Perugia, Italy, September 21–24, 2003 Revised Papers, Liotta G (ed) Springer, Berlin, pp 425–436
Walshaw C (2000) A multilevel algorithm for force-directed graph drawing. Graph Drawing 1984:171–182
Hu Y (2006) Efficient, high-quality force-directed graph drawing. Math J 10(1):37–71
Lin C-C, Yen H-C (2012) A new force-directed graph drawing method based on edge-edge repulsion. J Vis Lang Comput 23(1):29–42
Arleo A, Didimo W, Liotta G, Montecchiani F (2019) A distributed multilevel force-directed algorithm. IEEE Trans Parallel Distrib Syst 30(4):754–765
Suh A, Hajij M, Wang B, Scheidegger C, Rosen P (2020) Persistent homology guided force-directed graph layouts. IEEE Trans Vis Comput Graph 26(1):697–707
Hong S-H, Torkel M, Wang Z, Chae D, Hong S, Langerenken D, Chafi H (2019) Multi-level graph drawing using Infomap clustering. In: 27th international symposium, GD 2019, Prague, Czech Republic, Springer, Berlin, pp 139–146
Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):23
Walshaw C (2001) A multilevel algorithm for force-directed graph drawing. Springer, Berlin, pp 171–182
Wang Y, Jin Z, Wang Q, Cui W, Ma T, Qu H (2020) DeepDrawing: a deep learning approach to graph drawing. IEEE Trans Vis Comput Graph 26(1):676–686
Gove R (2019) A random sampling O(n) force-calculation algorithm for graph layouts. Comput Graph Forum 38(3):739–751
Barnes J, Hut P (1986) A hierarchical O(N log N) force-calculation algorithm. Nature 324(6096):446–449
Eberly DH (2007) Chapter 14—distance methods. In: 3D game engine design, 2nd edn, Morgan Kaufmann, San Francisco, pp 639–679
Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345
Himsolt M (1997) GML: a portable graph file format. https://pdfs.semanticscholar.org/d0a5/6b07a59a29b48d6f957763add90e05925c2c.pdf?_ga=2.114878407.1985112014.1581063714-1167339558.1581063714
KiNG Display Software. https://kinemage.biochem.duke.edu/software/king.php
King AD (2004) Graph clustering with restricted neighbourhood search. Graduate Department of Computer Science, University of Toronto
Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inf Process Lett 31(1):7–15
Ben-Israel A (1966) A Newton–Raphson method for the solution of systems of equations. J Math Anal Appl 15(2):243–252
Ph.D. Students in Computer Science, Pajek Dataset. https://vlado.fmf.uni-lj.si/pub/networks/data/esna/CSPhD.htm
Dolphins GML dataset. https://networkdata.ics.uci.edu/data/dolphins/dolphins.gml
Power grid dataset. https://www-personal.umich.edu/~mejn/netdata/power.zip
Acknowledgement
This research was funded by the University of Macau, under Grants MYRG2019-00136-FST and MYRG2018-00246-FST.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Lu, J., Si, YW. Clustering-based force-directed algorithms for 3D graph visualization. J Supercomput 76, 9654–9715 (2020). https://doi.org/10.1007/s11227-020-03226-w
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-020-03226-w