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.
CITATION STYLE
Purchase, H. C., Archambault, D., Kobourov, S., Nöllenburg, M., Pupyrev, S., & Wu, H. Y. (2020). The Turing Test for Graph Drawing Algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12590 LNCS, pp. 466–481). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-68766-3_36
Mendeley helps you to discover research relevant for your work.