Demonstration of a Preprocessor for the Spring Embedder

  • Paul Mutton
  • Peter Rodgers
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2528)

Abstract

Spring embedding is a widely used method for producing automated layouts of graphs. We present a preprocessor that improves the performance of the classical spring embedder, which can be used in conjunction with other optimization and approximation techniques. It creates an initial graph layout with edge lengths that are approximately equal and with a minimum node separation from which the spring embedder typically needs far fewer iterations to produce a well laid out graph.

References

  1. 1.
    P. Eades. A Heuristic for Graph Drawing. Congressus Numerantium 42. pp. 149–60. 1984.MathSciNetGoogle Scholar
  2. 2.
    A. Frick, A. Ludwig, H. Mehldau. A Fast Adaptive Layout Algorithm for Undirected Graphs. GD’94, LNCS 894. pp. 388–403. 1995.Google Scholar
  3. 3.
    T.M.J. Fruchterman, E.M. Reingold. Graph Drawing by Force-directed Placement. Software-Practice and Experience, Vol. 21(11). pp. 1129–1164. 1991.CrossRefGoogle Scholar
  4. 4.
    P. Gajer, M.T. Goodrich, S.G. Kobourov. A Fast Multi-Dimensional Algorithm for Drawing Large Graphs. GD 2000, LNCS 1984. pp. 211–221. 2001Google Scholar
  5. 5.
    P.J. Mutton, P.J. Rodgers. Spring Embedder Preprocessing forWWWVisualization. Proceedings of 6th International Conference on Information Visualization, IV02-WGV. pp. 744–749. 2002.Google Scholar
  6. 6.
    A.J. Quigley, Large Scale Relational Information Visualization, Clustering, and Abstraction, PhD Thesis, University of Newcastle, Australia. August 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Paul Mutton
    • 1
  • Peter Rodgers
    • 1
  1. 1.University of Kent at CanterburyCanterbury

Personalised recommendations