The Turing Test for Graph Drawing Algorithms

Autor:	Purchase, Helen C., Archambault, Daniel, Kobourov, Stephen, N��llenburg, Martin, Pupyrev, Sergey, Wu, Hsiang-Yun
Jazyk:	angličtina
Rok vydání:	2020
Předmět:	Social and Information Networks (cs.SI) FOS: Computer and information sciences Computer Science - Social and Information Networks MathematicsofComputing_DISCRETEMATHEMATICS
Popis:	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. Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dccfb6aae8b2fb7e4a66a62a26adb3fd http://arxiv.org/abs/2008.04869 Zobrazit plný text záznamu