Demonstration of a Preprocessor for the Spring Embedder

Mutton, Paul and Rodgers, Peter (2002) Demonstration of a Preprocessor for the Spring Embedder. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 374-375 (Official URL:

Full text not available from this repository.


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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-36151-0_40
Classifications:M Methods > M.999 Others
G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.070 Area / Edge Length
M Methods > M.400 Force-directed / Energy-based
ID Code:210

Repository Staff Only: item control page


P. Eades. A Heuristic for Graph Drawing. Congressus Numerantium 42. pp. 149-160. 1984.

A. Frick, A. Ludwig, H. Mehldau. A Fast Adaptive Layout Algorithm for Undirected Graphs. GD'94, LNCS 894. pp. 388-403. 1995.

T.M.J. Fruchterman, E.M. Reingold. Graph Drawing by Force-directed Placement. Software - Practice and Experience, Vol. 21 (11). pp. 1129-1164. 1991.

P. Gajer, M.T. Goodrich, S.G. Kobourov. A Fast Multi-Dimensional Algorithm for Drawing Large Graphs. GD 2000, LNCS 1984. pp. 211-221. 2001.

P.J. Mutton, P.J. Rodgers. Spring Embedder Preprocessing for WWW Visualization. Proceedings of the 6th International Conference on Information Visualization, IV02-WGW. pp. 744-749. 2002.

A.J. Quigley, Large Scale Relational Information Visualization, Clustering, and Abstraction, PhD Thesis, University of Newcastle, Australia. August 2001.