Repository logo
 

Visualizing Sets with Linear Diagrams

Accepted version
Peer-reviewed

Type

Article

Change log

Authors

Rodgers, Peter 
Chapman, Peter 

Abstract

jats:pThis paper presents the first design principles that optimize the visualization of sets using linear diagrams. These principles are justified through empirical studies that evaluate the impact of graphical features on task performance. Linear diagrams represent sets using straight line segments, with line overlaps corresponding to set intersections. This study builds on recent empirical research, which establishes that linear diagrams can be superior to prominent set visualization techniques, namely Euler and Venn diagrams. We address the problem of how to best visualize overlapping sets using linear diagrams. To solve the problem, we investigate which graphical features of linear diagrams significantly impact user task performance. To this end, we conducted seven crowdsourced empirical studies involving a total of 1,760 participants. These studies allowed us to identify the following design principles, which significantly aid task performance: use a minimal number of line segments, use guidelines where overlaps start and end, and draw lines that are thin as opposed to thick bars. We also evaluated the following graphical properties that did not significantly impact task performance: color, orientation, and set order. The results are brought to life through a freely available software implementation that automatically draws linear diagrams with user-controlled graphical choices. An important consequence of our research is that users are now able to create effective visualizations of sets automatically, thus improving human--computer interaction.</jats:p>

Description

Keywords

46 Information and Computing Sciences, 4607 Graphics, Augmented Reality and Games

Journal Title

ACM Transactions on Computer-Human Interaction

Conference Name

Journal ISSN

1073-0516
1557-7325

Volume Title

22

Publisher

Association for Computing Machinery (ACM)

Rights

All rights reserved