Spatial legend compatibility within versus between graphs in multiple graph comprehension Eva Riechelmann, Lynn Huestegge

Abstract

Previous research has shown that spatial compatibility between the data region and the legend of a graph is beneficial for comprehension. However, in multiple graphs, data–legend compatibility can come at the cost of spatial between-graph legend incompatibility. Here we aimed at determining which type of compatibility is most important for performance: global (legend–legend) compatibility between graphs, or local (data–legend) compatibility within graphs. Additionally, a baseline condition (incompatible) was included. Participants chose one out of several line graphs from a multiple panel as the answer to a data-related question. Compatibility type and the number of graphs per panel were varied. Whereas Experiment 1 involved simple graphs with only two lines/legend entries within each graph, Experiment 2 explored more complex graphs. The results indicated that compatibility speeds up comprehension, at least when a certain threshold of graph complexity is exceeded. Furthermore, we found evidence for an advantage of local over global data–legend compatibility under specific conditions. Taken together, the results further support the idea that compatibility principles strongly determine the ease of integration processes in graph comprehension and should thus be considered in multiple-panel design.

from #ORL-AlexandrosSfakianakis via ola Kala on Inoreader http://ift.tt/2ExT6Mu