Abstract

When looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms relate to a user's ability to perceive graph properties for a given graph layout. In this study, we apply previously established methodologies for perceptual analysis to identify which graph drawing layout will help the user best perceive a particular graph property. We conduct a large scale (n = 588) crowdsourced experiment to investigate whether the perception of two graph properties (graph density and average local clustering coefficient) can be modeled using Weber's law. We study three graph layout algorithms from three representative classes (Force Directed - FD, Circular, and Multi-Dimensional Scaling - MDS), and the results of this experiment establish the precision of judgment for these graph layouts and properties. Our findings demonstrate that the perception of graph density can be modeled with Weber's law. Furthermore, the perception of the average clustering coefficient can be modeled as an inverse of Weber's law, and the MDS layout showed a significantly different precision of judgment than the FD layout.

Original languageEnglish (US)
Pages (from-to)169-181
Number of pages13
JournalComputer Graphics Forum
Volume37
Issue number3
DOIs
StatePublished - Jun 1 2018

Fingerprint

Experiments

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this

Soni, U., Lu, Y., Hansen, B., Purchase, H. C., Kobourov, S., & Maciejewski, R. (2018). The Perception of Graph Properties in Graph Layouts. Computer Graphics Forum, 37(3), 169-181. https://doi.org/10.1111/cgf.13410

The Perception of Graph Properties in Graph Layouts. / Soni, Utkarsh; Lu, Yafeng; Hansen, Brett; Purchase, Helen C.; Kobourov, Stephen; Maciejewski, Ross.

In: Computer Graphics Forum, Vol. 37, No. 3, 01.06.2018, p. 169-181.

Research output: Contribution to journalArticle

Soni, U, Lu, Y, Hansen, B, Purchase, HC, Kobourov, S & Maciejewski, R 2018, 'The Perception of Graph Properties in Graph Layouts', Computer Graphics Forum, vol. 37, no. 3, pp. 169-181. https://doi.org/10.1111/cgf.13410
Soni, Utkarsh ; Lu, Yafeng ; Hansen, Brett ; Purchase, Helen C. ; Kobourov, Stephen ; Maciejewski, Ross. / The Perception of Graph Properties in Graph Layouts. In: Computer Graphics Forum. 2018 ; Vol. 37, No. 3. pp. 169-181.
@article{56fdc18f78174556b0cbcff164a1a29d,
title = "The Perception of Graph Properties in Graph Layouts",
abstract = "When looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms relate to a user's ability to perceive graph properties for a given graph layout. In this study, we apply previously established methodologies for perceptual analysis to identify which graph drawing layout will help the user best perceive a particular graph property. We conduct a large scale (n = 588) crowdsourced experiment to investigate whether the perception of two graph properties (graph density and average local clustering coefficient) can be modeled using Weber's law. We study three graph layout algorithms from three representative classes (Force Directed - FD, Circular, and Multi-Dimensional Scaling - MDS), and the results of this experiment establish the precision of judgment for these graph layouts and properties. Our findings demonstrate that the perception of graph density can be modeled with Weber's law. Furthermore, the perception of the average clustering coefficient can be modeled as an inverse of Weber's law, and the MDS layout showed a significantly different precision of judgment than the FD layout.",
author = "Utkarsh Soni and Yafeng Lu and Brett Hansen and Purchase, {Helen C.} and Stephen Kobourov and Ross Maciejewski",
year = "2018",
month = "6",
day = "1",
doi = "10.1111/cgf.13410",
language = "English (US)",
volume = "37",
pages = "169--181",
journal = "Computer Graphics Forum",
issn = "0167-7055",
publisher = "Wiley-Blackwell",
number = "3",

}

TY - JOUR

T1 - The Perception of Graph Properties in Graph Layouts

AU - Soni, Utkarsh

AU - Lu, Yafeng

AU - Hansen, Brett

AU - Purchase, Helen C.

AU - Kobourov, Stephen

AU - Maciejewski, Ross

PY - 2018/6/1

Y1 - 2018/6/1

N2 - When looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms relate to a user's ability to perceive graph properties for a given graph layout. In this study, we apply previously established methodologies for perceptual analysis to identify which graph drawing layout will help the user best perceive a particular graph property. We conduct a large scale (n = 588) crowdsourced experiment to investigate whether the perception of two graph properties (graph density and average local clustering coefficient) can be modeled using Weber's law. We study three graph layout algorithms from three representative classes (Force Directed - FD, Circular, and Multi-Dimensional Scaling - MDS), and the results of this experiment establish the precision of judgment for these graph layouts and properties. Our findings demonstrate that the perception of graph density can be modeled with Weber's law. Furthermore, the perception of the average clustering coefficient can be modeled as an inverse of Weber's law, and the MDS layout showed a significantly different precision of judgment than the FD layout.

AB - When looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms relate to a user's ability to perceive graph properties for a given graph layout. In this study, we apply previously established methodologies for perceptual analysis to identify which graph drawing layout will help the user best perceive a particular graph property. We conduct a large scale (n = 588) crowdsourced experiment to investigate whether the perception of two graph properties (graph density and average local clustering coefficient) can be modeled using Weber's law. We study three graph layout algorithms from three representative classes (Force Directed - FD, Circular, and Multi-Dimensional Scaling - MDS), and the results of this experiment establish the precision of judgment for these graph layouts and properties. Our findings demonstrate that the perception of graph density can be modeled with Weber's law. Furthermore, the perception of the average clustering coefficient can be modeled as an inverse of Weber's law, and the MDS layout showed a significantly different precision of judgment than the FD layout.

UR - http://www.scopus.com/inward/record.url?scp=85050310086&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050310086&partnerID=8YFLogxK

U2 - 10.1111/cgf.13410

DO - 10.1111/cgf.13410

M3 - Article

VL - 37

SP - 169

EP - 181

JO - Computer Graphics Forum

JF - Computer Graphics Forum

SN - 0167-7055

IS - 3

ER -