Planar Preprocessing for Spring Embedders

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.

[1]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[2]  Kim Marriott,et al.  Topology Preserving Constrained Graph Layout , 2009, GD.

[3]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[4]  Peter J. Stuckey,et al.  Exploration of Networks using overview+detail with Constraint-based cooperative layout , 2008, IEEE Transactions on Visualization and Computer Graphics.

[5]  Markus Chimani,et al.  The Open Graph Drawing Framework , 2013 .

[6]  Ulrik Brandes,et al.  Journal of Graph Algorithms and Applications More Flexible Radial Layout , 2022 .

[7]  Franz-Josef Brandenburg,et al.  An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms , 1995, GD.

[8]  François Bertault,et al.  A force-directed algorithm that preserves edge-crossing properties , 1999, Inf. Process. Lett..

[9]  Daniel W. Archambault,et al.  ImPrEd: An Improved Force‐Directed Algorithm that Prevents Nodes from Crossing Edges , 2011, Comput. Graph. Forum.

[10]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[11]  Ulrik Brandes,et al.  An Experimental Study on Distance-Based Graph Drawing , 2009, GD.

[12]  Goos Kant,et al.  Drawing planar graphs using the canonical ordering , 1996, Algorithmica.

[13]  Walter Didimo,et al.  Topology-Driven Force-Directed Algorithms , 2010, GD.

[14]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[15]  Daniel Tunkelang,et al.  JIGGLE: Java Interactive Graph Layout Environment , 1998, GD.

[16]  David Harel,et al.  Randomized graph drawing with heavy-duty preprocessing , 1994, AVI '94.

[17]  Martin Wattenberg,et al.  Centrality Based Visualization of Small World Graphs , 2008, Comput. Graph. Forum.

[18]  Michael Jünger,et al.  The Open Graph Drawing Framework (OGDF) , 2013, Handbook of Graph Drawing and Visualization.

[19]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[20]  Helen C. Purchase,et al.  Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.

[21]  Helen C. Purchase,et al.  Metrics for Graph Drawing Aesthetics , 2002, J. Vis. Lang. Comput..

[22]  Eric Fusy Uniform random sampling of planar graphs in linear time , 2009 .