Planar preprocessing for spring embedders

J. Joseph Fowler, Stephen G. Kobourov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


Spring embedders are conceptually simple and produce straight-line drawings with an undeniable aesthetic appeal, which explains their prevalence when it comes to automated graph drawing. However, when drawing planar graphs, spring embedders often produce non-plane drawings, as edge crossings do not factor into the objective function being minimized. On the other hand, there are fairly straight-forward algorithms for creating plane straight-line drawings for planar graphs, but the resulting layouts generally are not aesthetically pleasing, as vertices are often grouped in small regions and edges lengths can vary dramatically. It is known that the initial layout influences the output of a spring embedder, and yet a random layout is nearly always the default. We study the effect of using various plane initial drawings as an inputs to a spring embedder, measuring the percent improvement in reducing crossings and in increasing node separation, edge length uniformity, and angular resolution.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers
Number of pages12
StatePublished - 2013
Event20th International Symposium on Graph Drawing, GD 2012 - Redmond, WA, United States
Duration: Sep 19 2012Sep 21 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7704 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other20th International Symposium on Graph Drawing, GD 2012
Country/TerritoryUnited States
CityRedmond, WA

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Planar preprocessing for spring embedders'. Together they form a unique fingerprint.

Cite this