Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/58252
-
Title: 
The Turing Test for Graph Drawing Algorithms
-
Citation: 
Purchase, H., Archambault, D., Kobourov, S. G., Nöllenburg, M., Pupyrev, S., & Wu, H.-Y. (2020). The Turing Test for Graph Drawing Algorithms. In D. Archambault (Ed.), Graph Drawing and Network Visualization (GD 2020) (pp. 466–481). IEEE C.P.S. Publishing Services. https://doi.org/10.1007/978-3-030-68766-3_36
-
Publisher DOI: 
10.1007/978-3-030-68766-3_36
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
Purchase, Helen 
Archambault, Daniel 
Kobourov, Stephen G. 
Nöllenburg, Martin 
Pupyrev, Sergey 
Wu, Hsiang-Yun 
-
Organisational Unit: 
E193-02 - Forschungsbereich Computer Graphics 
E193 - Institut für Visual Computing and Human-Centered Technology 
-
Published in: 
Graph Drawing and Network Visualization (GD 2020) 
-
Volume: 
12590
-
Date (published): 
2020
-
Number of Pages: 
16
-
Publisher: 
IEEE C.P.S. Publishing Services
-
Publisher: 
Springer
-
Peer reviewed: 
Yes
-
Keywords: 
Empirical studies; Graph Drawing Algorithms; Turing Test
-
Abstract: 
Do algorithms for drawing graphs pass the Turing Test? Thatis, are their outputs indistinguishable from graphs drawn by humans? Weaddress this question through a human-centred experiment, focusing on`small´ graphs, of a size for which it would be reasonable for someone tochoose to draw the graph manually. Overall, we find that hand-drawnlayouts can be distinguished from those generated by graph dr...
en
Research Areas: 
Visual Computing and Human-Centered Technology: 100%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

207
checked on Nov 23, 2023

Google ScholarTM

Check