The Turing Test for Graph Drawing Algorithms

Helen C. Purchase, Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu
The Turing Test for Graph Drawing Algorithms
In Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD2020), pages 1-16. September 2020.
[image] [paper]

Information

  • Publication Type: Conference Paper
  • Workgroup(s)/Project(s):
  • Date: September 2020
  • Booktitle: Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD2020)
  • Call for Papers: Call for Paper
  • Event: 28th International Symposium on Graph Drawing and Network Visualization
  • Lecturer: Helen C. Purchase
  • Pages (from): 1
  • Pages (to): 16

Abstract

DoalgorithmsfordrawinggraphspasstheTuringTest?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 al- gorithms, although this is not always the case for graphs drawn by force- directed or multi-dimensional scaling algorithms, making these good can- didates 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.

Additional Files and Images

Additional images and videos

Additional files

Weblinks

No further information available.

BibTeX

@inproceedings{Purchase-2020-gd,
  title =      "The Turing Test for Graph Drawing Algorithms",
  author =     "Helen  C. Purchase and Daniel Archambault and Stephen
               Kobourov and Martin N\"{o}llenburg and Sergey Pupyrev and
               Hsiang-Yun Wu",
  year =       "2020",
  abstract =   "DoalgorithmsfordrawinggraphspasstheTuringTest?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 al-
               gorithms, although this is not always the case for graphs
               drawn by force- directed or multi-dimensional scaling
               algorithms, making these good can- didates 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.",
  month =      sep,
  booktitle =  "Proceedings of the 28th International Symposium on Graph
               Drawing and Network Visualization (GD2020)",
  event =      "28th International Symposium on Graph Drawing and Network
               Visualization ",
  pages =      "1--16",
  URL =        "/research/publications/2020/Purchase-2020-gd/",
}