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. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
Mutton, P., & Rodgers, P. (2002). Demonstration of a preprocessor for the spring embedder. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 374–375). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_40
Mendeley helps you to discover research relevant for your work.