Exploring the Effect of Animation and Progressive Revealing on Diagrammatic Problem Solving

We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra’s algorithm). The goal of these studies was to investigate how people reason about and solve graphically presented problems. First, we compared performance when th...

Full description

Saved in:
Bibliographic Details
Published inDiagrammatic Representation and Inference pp. 226 - 240
Main Authors Yoon, Daesub, Narayanan, N. Hari, Lee, SooCheol, Kwon, Oh-Cheon
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Exact sciences and technology
Artificial life
Graph path
User interface
Knowledge representation
Shortest path
Diagrammatic method
Routing
Dijstra algorithm
Pursuit eye movement
Display
Online AccessGet full text

Cover

More Information
Summary:We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra’s algorithm). The goal of these studies was to investigate how people reason about and solve graphically presented problems. First, we compared performance when the graphical display was animated to when the display was static. Second, we compared performance when the display was initially sparse, with detailed information being progressively revealed, to when the display presented all information simultaneously. Results suggest that while animation of the procedure or algorithm does not improve accuracy, animation coupled with progressively revealing objects of interest on the display does improve accuracy and other process measures of problem solving.
ISBN:9783540356233
3540356231
ISSN:0302-9743
1611-3349
DOI:10.1007/11783183_31