Reduction of Visual Complexity in Dynamic Graphs
Kimelman, Doug and Leban, Bruce and Roth, Tova and Zernik, Dror (1995) Reduction of Visual Complexity in Dynamic Graphs. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 218-225 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_373).
Full text not available from this repository.
Graphs are used extensively in software visualization to represent both static aspects of software structure and dynamic aspects of execution-time behavior. However, for realistic subject software systems, there are far too many nodes and edges in the displayed graphs to be comprehensible to an end user. Further, for presentation of dynamics, continual change and redisplay of such large graphs is too demanding for conventional workstation computational resources. This paper poses the problem of "reduction" or "abstraction" in dynamically changing graphs, and proposes a combination of techniques that can be used to reduce the visual complexity of a graph, without obscuring the significant information that it was meant to convey. The abstract graph can be comprehended more readily and it changes far less frequently than the full graph. As well, when the abstract graph does change, it requires far less computation for layout and redisplay. These abstraction techniques are illustrated by way of examples showing their use in systems for visualization of objekt-oriented and multi-layer software systems.
Repository Staff Only: item control page