Aesthetic of angular resolution for node-link diagrams: Validation and algorithm

When visualizing graphs into node-link diagrams, angular resolution is often used as one of the aesthetic criteria measuring the diagram quality in terms of human comprehension. However, angular resolution has not been empirically validated for its relevance to humans. In addition, although many force-directed algorithms have been proposed for automatic graph drawing, performance evaluation of these algorithms has not been conclusive due to the lack of proper methods. To shorten these gaps, this paper 1) validates the aesthetic based on human experimental data and identifies the best of angular resolution measures used in the literature; 2) introduces a force-directed algorithm, forceAR, for improving angular resolution; 3) proposes a new framework for more reliable and thorough evaluation of force-directed algorithms. Finally as a case study, our forceAR algorithm is evaluated using this framework.

[1]  Peter Rodgers,et al.  Applying graphical design techniques to graph visualisation , 2005, Ninth International Conference on Information Visualisation (IV'05).

[2]  Weidong Huang,et al.  Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics , 2010, 2010 IEEE Symposium on Visual Languages and Human-Centric Computing.

[3]  B. Hayes Graph Theory in Practice: Part II , 2000, American Scientist.

[4]  Kang Zhang,et al.  Node overlap removal in clustered directed acyclic graphs , 2009, J. Vis. Lang. Comput..

[5]  David Eppstein,et al.  A steady state model for graph power laws , 2002, ArXiv.

[6]  Kim Marriott,et al.  Drawing directed graphs using quadratic programming , 2006, IEEE Transactions on Visualization and Computer Graphics.

[7]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[8]  Kim Marriott,et al.  Integrating Edge Routing into Force-Directed Layout , 2006, GD.

[9]  Roberto Tamassia,et al.  Curvilinear Graph Drawing Using the Force-Directed Method , 2004, GD.

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

[11]  Weidong Huang,et al.  How People Read Graphs , 2005, APVIS.

[12]  Hsu-Chun Yen,et al.  A new force-directed graph drawing method based on edge-edge repulsion , 2005, Ninth International Conference on Information Visualisation (IV'05).

[13]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.