The Turing Test for Graph Drawing Algorithms

Do algorithms for drawing graphs pass the Turing Test? That is, are their outputs indistinguishable from graphs drawn by humans? We address this question through a human-centred experiment, focusing on `small' graphs, of a size for which it would be reasonable for someone to choose to draw the graph manually. Overall, we find that hand-drawn layouts can be distinguished from those generated by graph drawing algorithms, although this is not always the case for graphs drawn by force-directed or multi-dimensional scaling algorithms, making these good candidates for Turing Test success. We show that, in general, hand-drawn graphs are judged to be of higher quality than automatically generated ones, although this result varies with graph size and algorithm.

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

[2]  Michael Kaufmann,et al.  Algorithms and Area Bounds for Nonplanar Orthogonal Drawings , 1997, GD.

[3]  Chi-Wing Fu,et al.  Revisiting Stress Majorization as a Unified Framework for Interactive Constrained Graph Visualization , 2018, IEEE Transactions on Visualization and Computer Graphics.

[4]  Michael C. Hout,et al.  Multidimensional Scaling , 2003, Encyclopedic Dictionary of Archaeology.

[5]  Beryl Plimmer,et al.  Graph Drawing Aesthetics—Created by Users, Not Algorithms , 2012, IEEE Transactions on Visualization and Computer Graphics.

[6]  Ioannis G. Tollis,et al.  Circular Drawing Algorithms , 2013, Handbook of Graph Drawing and Visualization.

[7]  Yifan Hu,et al.  COAST: A Convex Optimization Approach to Stress-Based Embedding , 2013, GD.

[8]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[9]  Ioannis G. Tollis,et al.  The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing , 1997, Graph Drawing.

[10]  Goos Kant,et al.  A Better Heuristic for Orthogonal Graph Drawings , 1994, ESA.

[11]  Colin Bell,et al.  A Community Based Systems Diagram of Obesity Causes , 2015, PloS one.

[12]  Emden R. Gansner,et al.  Graphviz - Open Source Graph Drawing Tools , 2001, GD.

[13]  Yehuda Koren,et al.  Improved Circular Layouts , 2006, GD.

[14]  Sándor P. Fekete,et al.  Orthogonal Graph Drawing , 2001, Drawing Graphs.

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

[16]  David Harel,et al.  A multi-scale algorithm for drawing graphs nicely , 1999, Discret. Appl. Math..

[17]  Kim Marriott,et al.  HOLA: Human-like Orthogonal Network Layout , 2016, IEEE Transactions on Visualization and Computer Graphics.

[18]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[19]  Chris North,et al.  A Comparison of User-Generated and Automatic Graph Layouts , 2009, IEEE Transactions on Visualization and Computer Graphics.

[20]  Karsten Klein,et al.  An Experimental Evaluation of Multilevel Layout Methods , 2010, GD.

[21]  Yifan Hu,et al.  Efficient, High-Quality Force-Directed Graph Drawing , 2006 .

[22]  Sumio Masuda,et al.  Crossing Minimization in Linear Embeddings of Graphs , 1990, IEEE Trans. Computers.

[23]  Yifan Hu,et al.  A Maxent-Stress Model for Graph Layout , 2012, IEEE Transactions on Visualization and Computer Graphics.

[24]  Y. Takane,et al.  Multidimensional Scaling I , 2015 .

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

[26]  Stephen G. Kobourov,et al.  Journal of Graph Algorithms and Applications Grip: Graph Drawing with Intelligent Placement , 2022 .

[27]  Roberto Tamassia,et al.  Handbook on Graph Drawing and Visualization , 2013 .

[28]  David Harel,et al.  ACE: a fast multiscale eigenvectors computation for drawing huge graphs , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..

[29]  Michael Kaufmann,et al.  yFiles - Visualization and Automatic Layout of Graphs , 2001, Graph Drawing Software.

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

[31]  Ayellet Tal,et al.  Online Dynamic Graph Drawing , 2008, IEEE Transactions on Visualization and Computer Graphics.

[32]  Ulrik Brandes,et al.  Eigensolver Methods for Progressive Multidimensional Scaling of Large Data , 2006, GD.

[33]  Bernice E. Rogowitz,et al.  Perceptual Organization in User-Generated Graph Layouts , 2008, IEEE Transactions on Visualization and Computer Graphics.

[34]  W. Torgerson.  Multidimensional scaling: I. Theory and method , 1952 .

[35]  Tobias Isenberg,et al.  Non-photorealistic rendering in context: an observational study , 2006, NPAR.

[36]  Claire Pennarun,et al.  Planar Graphs as L-intersection or L-contact graphs , 2017, SODA.

[37]  David Harel,et al.  A fast multi-scale method for drawing large graphs , 2000, AVI '00.

[38]  Ulrik Brandes,et al.  Crossing Reduction in Circular Layouts , 2004, WG.

[39]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[40]  Robert F. Cohen,et al.  Validating Graph Drawing Aesthetics , 1995, GD.

[41]  Paul Vickers,et al.  A survey of two-dimensional graph layout techniques for information visualisation , 2013, Inf. Vis..

[42]  Martin Nöllenburg,et al.  Experimental Evaluation of Book Drawing Algorithms , 2017, GD.