No Cover Image

Conference Paper/Proceeding/Abstract 13371 views 298 downloads

The Turing Test for Graph Drawing Algorithms

Helen C. Purchase Orcid Logo, Daniel Archambault Orcid Logo, Stephen Kobourov Orcid Logo, Martin Nöllenburg Orcid Logo, Sergey Pupyrev Orcid Logo, Hsiang-Yun Wu Orcid Logo

Lecture Notes in Computer Science, Volume: 12590, Pages: 466 - 481

Swansea University Author: Daniel Archambault Orcid Logo

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: Lecture Notes in Computer Science
ISBN: 9783030687656 9783030687663
ISSN: 0302-9743 1611-3349
Published: Cham Springer International Publishing 2021
Online Access: Check full text

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.
Keywords: Empirical studies, Graph Drawing Algorithms, Turing Test
College: Faculty of Science and Engineering
Start Page: 466
End Page: 481