No Cover Image

Conference Paper/Proceeding/Abstract 20 views 1 download

The Turing Test for Graph Drawing Algorithms / Helen C Purchase; Daniel Archambault; Stephen Kobourov; Martin Nöllenburg ; Sergey Pupyrev; Hsiang-Yun Wu

Graph Drawing and Network Visualization

Swansea University Author: Daniel, Archambault

Abstract

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...

Full description

Published in: Graph Drawing and Network Visualization
Published: Springer LNCS
URI: https://cronfa.swan.ac.uk/Record/cronfa55001
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract: 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.
Item Description: arXiv open access version available here: https://arxiv.org/abs/2008.04869
Keywords: Empirical studies, Graph Drawing Algorithms, Turing Test
College: College of Science