Skeletal Images as Visual Cues in Graph Visualization
The problem of graph layout and drawing is fundamental to many approaches to the visualization of relational information structures. As the data set grows, the visualization problem is compounded by the need to reconcile the user’s need for orientation cues with the danger of information overload. Put simply: How can we limit the number of visual elements on the screen so as not to overwhelm the user yet retain enough information that the user is able to navigate and explore the data set confidently? How can we provide orientational cues so that a user can understand the location of the current viewpoint in a large data set? These are problems inherent not only to graph drawing but information visualization in general. We propose a method which extracts the significant features of a directed acyclic graph as the basis for navigation 1.
KeywordsSource Node Directed Acyclic Graph Sink Node Schematic View Information Visualization
Unable to display preview. Download preview PDF.
- 1.Chuah M.C. Dynamic Aggregation with Circular Visual Designs. In Wills G. and Dill J., editors, Proceedings of the IEEE Symposium on Information Visualization (Info Viz ‘88), Los Alamitos, pages 35–43. IEEE CS Press, 1998.Google Scholar
- 2.Delest M., Herman I., and Melançon G. Tree Visualization and Navigation Clues for Information Visualization. Computer Graphics Forum, 17 (2), 1998.Google Scholar
- 5.Lamping J., Rao R., and Pirolli P. A focus+context technique based on hyperbolic geometry for viewing large hierarchies. In ACM CHI’95. ACM Press, 1995.Google Scholar
- 8.Schaffer D., Zuo Z., Greenberg S., Bartram L., Dill J., Dubs S., and Roseman M. Navigating hierarchically clustered networks through fisheye and full-zoom methods. ACM Transactions on Computer-Human Interaction, 3 (2), 1996.Google Scholar
- 9.Keahey T.A. The Generalized Detail-In-Context Problem. In Wills G. and Dill J., editors, Proceedings of the IEEE Symposium on Information Visualization (Info Viz ‘88), Los Alamitos. IEEE CS Press, 1998.Google Scholar