查看文章

Preserving the mental map is frequently cited by dynamic graph drawing algorithm designers as an important optimization criterion. There have been a number of definitions for mental map preservation and many different algorithmic approaches to drive dynamic graph drawing to satisfy these definitions. One of the most frequently used definitions is that of Coleman and Parker where “the placement of existing nodes and edges should change as little as possible when a change is made to the graph.” A number of experiments have been run to test the effectiveness of this definition from a usability perspective. To date, no experiment has found conclusive evidence that supports the effectiveness of the mental map in the comprehension of a dynamic graph series. In this paper, we summarize the experiments conducted on this definition of mental map preservation and provide recommendations to designers and …