International Symposium on Graph Drawing and Network Visualization

Graph Drawing and Network Visualization pp 52-59 | Cite as

Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9411)

Abstract

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).

References

  1. 1.
    Barnes, J., Hut, P.: A hierarchical \(O(N \log N)\) force-calculation algorithm. Nature 324(6096), 446–449 (1986)CrossRefGoogle Scholar
  2. 2.
    Bartel, G., Gutwenger, C., Klein, K., Mutzel, P.: An experimental evaluation of multilevel layout methods. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 80–91. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  3. 3.
    Brandenburg, F.J., Himsolt, M., Rohrer, C.: An experimental comparison of force-directed and randomized graph drawing algorithms. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 76–87. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  4. 4.
    Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to \(k\)-nearest-neighbors and \(n\)-body potential fields. J. ACM 42(1), 67–90 (1995)MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Eades, P.: A heuristics for graph drawing. Congr. Numerantium 42, 146–160 (1984)MathSciNetGoogle Scholar
  6. 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
  7. 7.
    Fink, M., Haverkort, H., Nöllenburg, M., Roberts, M., Schuhmann, J., Wolff, A.: Drawing metro maps using Bézier curves. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 463–474. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  8. 8.
    Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 388–403. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  9. 9.
    Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129–1164 (1991)CrossRefGoogle Scholar
  10. 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
  11. 11.
    Hachul, S., Jünger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285–295. Springer, Heidelberg (2005) CrossRefGoogle Scholar
  12. 12.
    JUNG: Java Universal Network/Graph Framework. http://jung.sourceforge.net. Accessed 2 September 2015
  13. 13.
    Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, New York, NY, USA (2007)MATHCrossRefGoogle Scholar
  14. 14.
  15. 15.
    Walshaw, C.: A multilevel algorithm for force-directed graph-drawing. J. Graph Algorithms Appl. 7(3), 253–285 (2003)MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Lehrstuhl für Informatik IUniversität WürzburgWürzburgGermany

Personalised recommendations