Skip to main content
Kent Academic Repository

Demonstration of a Preprocessor for the Spring Embedder

Mutton, Paul, Rodgers, Peter (2002) Demonstration of a Preprocessor for the Spring Embedder. In: Goodrich, Michael T. and Kobourov, Stephen G., eds. GD 2002, LNCS 2528. Lecture Notes in Computer Science . pp. 374-375. Springer, Berlin, Germany ISBN 978-3-540-00158-4. E-ISBN 978-3-540-36151-0. (doi:10.1007/3-540-36151-0_40) (KAR id:13754)

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.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1007/3-540-36151-0_40
Uncontrolled keywords: Spring Embedding; Preprocessing; edge length; large graph; information visualization; layout algorithm; linear time complexity
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Peter Rodgers
Date Deposited: 24 Nov 2008 17:59 UTC
Last Modified: 16 Nov 2021 09:51 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13754 (The current URI for this page, for reference purposes)

University of Kent Author Information

Mutton, Paul.

Creator's ORCID:
CReDIT Contributor Roles:

Rodgers, Peter.

Creator's ORCID: https://orcid.org/0000-0002-4100-3596
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.