The Effect of Graph Layout on the Perception of Graph Properties
| dc.contributor.author | Kypridemou, Elektra | en_US |
| dc.contributor.author | Zito, Michele | en_US |
| dc.contributor.author | Bertamini, Marco | en_US |
| dc.contributor.editor | Kerren, Andreas and Garth, Christoph and Marai, G. Elisabeta | en_US |
| dc.date.accessioned | 2020-05-24T13:51:50Z | |
| dc.date.available | 2020-05-24T13:51:50Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | The way in which a graph is described visually is crucial for the understanding and analysis of its structure. In this study we explore how different drawing layouts affect our perception of the graph's properties. We study the perception of connectedness, tree-ness and density using four different layouts: the Circular, Grid, Planar and Spring layouts. Results show that some layouts are better than others when we need to decide whether a graph is a tree or is connected. More sophisticated algorithms, like Planar and Spring, facilitate our perception, while Circular and Grid layouts lead to performance not better than chance. However, when perceiving the density of a graph, no layout was found to be better than the others. | en_US |
| dc.description.sectionheaders | Analytics and Evaluation | |
| dc.description.seriesinformation | EuroVis 2020 - Short Papers | |
| dc.identifier.doi | 10.2312/evs.20201039 | |
| dc.identifier.isbn | 978-3-03868-106-9 | |
| dc.identifier.pages | 1-5 | |
| dc.identifier.uri | https://doi.org/10.2312/evs.20201039 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.2312/evs20201039 | |
| dc.publisher | The Eurographics Association | en_US |
| dc.rights | Attribution 4.0 International License | |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | ] |
| dc.subject | Human centered computing | |
| dc.subject | Graph drawings | |
| dc.subject | Empirical studies in visualization | |
| dc.subject | Computing methodologies | |
| dc.subject | Perception | |
| dc.title | The Effect of Graph Layout on the Perception of Graph Properties | en_US |