TY - GEN
T1 - Planar preprocessing for spring embedders
AU - Fowler, J. Joseph
AU - Kobourov, Stephen G.
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84874119344&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84874119344&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-36763-2_35
DO - 10.1007/978-3-642-36763-2_35
M3 - Conference contribution
AN - SCOPUS:84874119344
SN - 9783642367625
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 388
EP - 399
BT - Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers
T2 - 20th International Symposium on Graph Drawing, GD 2012
Y2 - 19 September 2012 through 21 September 2012
ER -