Focus+Context Taken Literally

IEEE Computer Graphics and Applications

Volumn 22, Issue 1, 2002, Pages 22-29

  Kosara, Robert ^a   Miksch, Silvia ^a   Hauser, Helwig ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b VRVIS RESEARCH CENTER   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85008004976     PISSN: 02721716     EISSN: None     Source Type: Journal    
DOI: 10.1109/38.974515     Document Type: Article

References (8)

1. G. DiBattista et al., Graph Drawing, Algorithms for the Visualization of Graphs, Prentice-Hall, Upper Saddle River, N.J., 1999.
2. K. Sugiyama, S. Tagawa, and M. Toda, “Methods for Visual Understanding of Hierarchical Systems,” IEEE Trans. Systems, Man, and Cybernetics, vol. 21, no. 2, Feb. 1981, pp. 109-125.
3. T.C. Biedl, B.P. Madden, and I.G. Tollis, “The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing,” Graph Drawing (Proc. GD 97), G. DiBattista, ed., Lecture Notes in Computer Science 1343, Springer-Verlag, Berlin, 1998, pp. 391-402.
4. T. Kamada and S. Kawai, “An Algorithm for Drawing General Undirected Graphs,” Information Processing Letters, vol. 31, no. 1, Apr. 1989, pp. 7-15.
5. U. Dogrusoz, B. Madden, and P. Madden, “Circular Layout in the Graph Layout Toolkit,” Graph Drawing (Proc. GD 96), S. North, ed., Lecture Notes in Computer Science 1190, Springer-Verlag, Berlin, 1997, pp. 92-100.
6. U. Dogrusoz et al., “Edge Labeling in the Graph Layout Toolkit,” Graph Drawing (Proc. GD 98), S.H. Whitesides, ed., Lecture Notes in Computer Science 1547, Springer-Verlag, Berlin, 1998, pp. 356-363.
7. M. Doorley and A. Cahill, “Experiences in Automatic Levelling of Data Flow Diagrams,” Proc. 4th Workshop Program Comprehension, IEEE CS Press, Los Alamitos, Calif., 1996, pp. 218-229.
8. D. Kimelman et al., “Dynamic Graph Abstraction for Effective Software Visualization,” Australian Computer J., vol. 27, no. 4, Nov. 1995, pp. 129-137.