arXiv Open Access 2020

The Turing Test for Graph Drawing Algorithms

Helen C. Purchase Daniel Archambault Stephen Kobourov Martin Nöllenburg Sergey Pupyrev +1 lainnya

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.SI

Penulis (6)

Helen C. Purchase

Daniel Archambault

Stephen Kobourov

Martin Nöllenburg

Sergey Pupyrev

Hsiang-Yun Wu

Format Sitasi

APA MLA BibTeX

Purchase, H.C., Archambault, D., Kobourov, S., Nöllenburg, M., Pupyrev, S., Wu, H. (2020). The Turing Test for Graph Drawing Algorithms. https://arxiv.org/abs/2008.04869

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2020
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓