AuthorPurchase, Helen C.
AffiliationUniversity of Arizona
MetadataShow full item record
CitationPurchase, H. C., Archambault, D., Kobourov, S., Nöllenburg, M., Pupyrev, S., & Wu, H. Y. (2020). The Turing Test for Graph Drawing Algorithms. International Symposium on Graph Drawing and Network Visualization: Graph Drawing and Network Visualization, 466-481.
Rights©Springer Nature Switzerland AG 2020.
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at firstname.lastname@example.org.
AbstractDo 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. © 2020, Springer Nature Switzerland AG.
Note12 month embargo; first published online 14 February 2021
VersionFinal accepted manuscript