Mutton, Paul and Rodgers, Peter (2002) Demonstration of a Preprocessor for the Spring Embedder. In: Zeytovnian, R. and Kobourov, R.K. and Goodrich, M.T. and Kobourov, S.G., eds. Graph Drawing: 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28 2002. Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence. Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin pp. 374-375. ISBN 9783540001584.
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)|
|Uncontrolled keywords:||Spring Embedding; Preprocessing|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group
Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
|Depositing User:||Peter Rodgers|
|Date Deposited:||24 Nov 2008 17:59|
|Last Modified:||28 Sep 2012 09:00|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/13754 (The current URI for this page, for reference purposes)|
- Depositors only (login required):