Article

Using games to investigate movement for graph comprehension

Authors:

John Bovey,

Florence Benoy,

Peter RodgersAuthors Info & Claims

AVI '04: Proceedings of the working conference on Advanced visual interfaces

Pages 71 - 79

https://doi.org/10.1145/989863.989872

Published: 25 May 2004 Publication History

Get Access

Abstract

We describe the results of empirical investigations that explore the effectiveness of moving graph diagrams to improve the comprehension of their structure. The investigations involved subjects playing a game that required understanding the structure of a number of graphs. The use of a game as the task was intended to motivate the exploration of the graph by the subjects. The results show that movement can be beneficial when there is node-node or node-edge occlusion in the graph diagram but can have a detrimental effect when there is no occlusion, particularly if the diagram is small. We believe the positive result should generalise to other graph exploration tasks, and that graph movement is likely be useful as an additional graph exploration tool.

References

[1]

J. D. Bovey, P. J. Rodgers, and P. M. Benoy. Movement as an Aid to Understanding Graphs. In 7th International Conference on Information Visualization (IV03), pages 472--478. IEEE, July 2003.]]

Digital Library

Google Scholar

[2]

S. Feiner, D. Salesin and T. Banchoff. Dial: A Diagrammatic Animation Language. IEEE Computer Graphics and Applications 2, 9 pp. 43--54. 1982.]]

Digital Library

Google Scholar

[3]

C. Friedrich and P. Eades. Graph Drawing in Motion. Vol. 6, no. 3, pp. 353--370. 2002.]]

Google Scholar

[4]

F. Höfting, E. Wanke, A. Balmośan and C. Bergmann. 1st Grade - A System for Implementation, Testing and Animation of Graph Algorithms. LNCS 665, pp. 706--707. 1993.]]

Digital Library

Google Scholar

[5]

H. C. Purchase, R. F. Cohen, and M. James. Validating Graph Drawing Aesthetics. GD95, LNCS 1027, 435--446. 1995.]]

Digital Library

Google Scholar

[6]

P. J. Rodgers and N. Vidal. Graph Algorithm Animation with Grrr. In Agtive99: Applications of Graph Transformations with Industrial Relevance, LNCS 1779, pages 379--394. 2000.]]

Crossref

Google Scholar

[7]

C. Ware, G. Frank. Evaluating Stereo and Motion Cues for Visualizing Information Nets in Three Dimensions. ACM Transactions on Graphics Vol.15, no. 2, pp. 121--140. 1996]]

Digital Library

Google Scholar

Cited By

View all

Morrison BPreston J(2009)EngagementACM SIGCSE Bulletin10.1145/1539024.150899041:1(342-346)Online publication date: 4-Mar-2009
https://dl.acm.org/doi/10.1145/1539024.1508990
Morrison BPreston JFitzgerald SGuzdial MLewandowski GWolfman S(2009)EngagementProceedings of the 40th ACM technical symposium on Computer science education10.1145/1508865.1508990(342-346)Online publication date: 4-Mar-2009
https://dl.acm.org/doi/10.1145/1508865.1508990
Benoy FRodgers P(2007)Evaluating the Comprehension of Euler DiagramsProceedings of the 11th International Conference Information Visualization10.1109/IV.2007.45(771-780)Online publication date: 4-Jul-2007
https://dl.acm.org/doi/10.1109/IV.2007.45
Show More Cited By

Index Terms

Using games to investigate movement for graph comprehension
1. Computing methodologies
  1. Computer graphics
    1. Animation
    2. Graphics systems and interfaces
      1. Graphics file formats
  2. Modeling and simulation
    1. Simulation types and techniques
      1. Simulation by animation

Recommendations

(d+1,2) -Track Layout of Bipartite Graph Subdivisions

A ( k ,2- track layout of a graph G consists of a 2- track assignment of G and an edge k -coloring of G with no monochromatic X-crossing . This paper studies the problem of ( k ,2)-track layout of bipartite graph subdivisions. Recently V.Dujmović and ...
Queue Layout of Bipartite Graph Subdivisions

For an integer d > 0, a d-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into d sets of non-nested edges with respect to the vertex ordering. Recently V. Dujmović and D. R. Wood showed that for every ...
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring
FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science

Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the separator can be as large as Ω(__ __n) in graphs with n vertices. This is the case for planar ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

AVI '04: Proceedings of the working conference on Advanced visual interfaces

May 2004

425 pages

ISBN:1581138679

DOI:10.1145/989863

General Chair:
Maria Francesca Costabile
University of Bari, Italy

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 May 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

AVI04

Sponsor:

SIGMM

AVI04: International Conference on Advanced Visual Interfaces

May 25 - 28, 2004

Gallipoli, Italy

Acceptance Rates

Overall Acceptance Rate 128 of 490 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
353
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Morrison BPreston J(2009)EngagementACM SIGCSE Bulletin10.1145/1539024.150899041:1(342-346)Online publication date: 4-Mar-2009
https://dl.acm.org/doi/10.1145/1539024.1508990
Morrison BPreston JFitzgerald SGuzdial MLewandowski GWolfman S(2009)EngagementProceedings of the 40th ACM technical symposium on Computer science education10.1145/1508865.1508990(342-346)Online publication date: 4-Mar-2009
https://dl.acm.org/doi/10.1145/1508865.1508990
Benoy FRodgers P(2007)Evaluating the Comprehension of Euler DiagramsProceedings of the 11th International Conference Information Visualization10.1109/IV.2007.45(771-780)Online publication date: 4-Jul-2007
https://dl.acm.org/doi/10.1109/IV.2007.45
Huang WHong SEades P(2006)Predicting graph reading performanceProceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 6010.5555/1151903.1151933(207-216)Online publication date: 1-Jan-2006
https://dl.acm.org/doi/10.5555/1151903.1151933
Bovey J(2005)Using Games to Do Exploratory Experiments in Graph ComprehensionProceedings of the Ninth International Conference on Information Visualisation10.1109/IV.2005.132(335-338)Online publication date: 6-Jul-2005
https://dl.acm.org/doi/10.1109/IV.2005.132

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

(d+1,2) -Track Layout of Bipartite Graph Subdivisions

Queue Layout of Bipartite Graph Subdivisions

Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring