Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
The force-directed paradigm is one of the few generic approaches to drawing graphs. Since force-directed algorithms can be extended easily, they are used frequently. Most of these algorithms are, however, quite slow on large graphs as they compute a quadratic number of forces in each iteration. We speed up this computation by using an approximation based on the well-separated pair decomposition.
We perform experiments on a large number of graphs and show that we can strongly reduce the runtime—even on graphs with less then a hundred vertices—without a significant influence on the quality of the drawings (in terms of number of crossings and deviation in edge lengths).
- 6.Eppstein, D., Wang, J.Y.: A steady state model for graph power laws. In: 2nd International Workshop Web Dynamics (2002). http://arxiv.org/abs/cs/0204001
- 10.Gronemann, M.: Engineering the fast-multipole-multilevel method for multicore and SIMD architectures. Master’s thesis, Department of Computer Science, TU Dortmund (2009)Google Scholar
- 12.JUNG: Java Universal Network/Graph Framework. http://jung.sourceforge.net. Accessed 2 September 2015
- 14.Rome Graphs. http://graphdrawing.org/data.html, http://www.graphdrawing.org/download/rome-graphml.tgz. Accessed 2 September 2015