
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ivan Herman, Guy Melançon, M. Scott Marshall, "Graph Visualization and Navigation in Information Visualization: A Survey," IEEE Transactions on Visualization and Computer Graphics, vol. 6, no. 1, pp. 2443, JanuaryMarch, 2000.  
BibTex  x  
@article{ 10.1109/2945.841119, author = {Ivan Herman and Guy Melançon and M. Scott Marshall}, title = {Graph Visualization and Navigation in Information Visualization: A Survey}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {6}, number = {1}, issn = {10772626}, year = {2000}, pages = {2443}, doi = {http://doi.ieeecomputersociety.org/10.1109/2945.841119}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  Graph Visualization and Navigation in Information Visualization: A Survey IS  1 SN  10772626 SP24 EP43 EPD  2443 A1  Ivan Herman, A1  Guy Melançon, A1  M. Scott Marshall, PY  2000 KW  Information visualization KW  graph visualization KW  graph drawing KW  navigation KW  focus+context KW  fisheye KW  clustering. VL  6 JA  IEEE Transactions on Visualization and Computer Graphics ER   
Abstract—This is a survey on graph visualization and navigation techniques, as used in information visualization. Graphs appear in numerous applications such as web browsing, statetransition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs is often a crucial part of an application. Information visualization has specific requirements, which means that this survey approaches the results of traditional graph drawing from a different perspective.
[1] C.J. Alpert and A.B. Kahng, “Recent Directions in Netlist Partitioning: A Survey,” VLSI J., vol. 19, nos. 12, pp. 1–81, 1995.
[2] K. Andrews, "Visualizing Cyberspace: Information Visualization inthe Harmony Internet Browser," Proc. Info. Vis. Symp. 95, N. Gershon and S.G. Eick, eds., IEEE CS Press, Los Alamitos, Calif., 1995, pp. 97104.
[3] P.K. Argawal, B. Aronov, J. Pach, R. Pollack, and M. Sharir, “QuasiPlanar Graphs Have a Linear Number of Edges,” Proc. Symp. Graph Drawing, GD '95, pp. 17, 1995.
[4] G. DiBattista, P. Eades, R. Tamassia, and I.G. Tollis, "Algorithms for Drawing Graphs: An Annotated Bibliography," Computational Geometry: Theory and Applications, vol. 4, no 5, pp. 235282, 1994. Also available via anonymous ftp from,, andin.
[5] G. di Battista, P. Eades, R. Tamassia, and I.G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
[6] R.A. Becker, S.G. Eick, and A.R. Wilks, “Visualizing Network Data,” IEEE Trans. Visualization and Computer Graphics, vol. 1, no. 1, pp. 1628, Mar. 1995.
[7] I. BenShaul, M. Herscovici, M. Jacovi, Y.S. Maarek, D. Pelleg, M. Shtalhaim, V. Soroka, and S. Ur, “Adding Support for Dynamic and Focused Search with Fetuccino,” Proc. Eighth Int'l World Wide Web Conf., pp. 575587, 1999.
[8] J. Berry, N. Dean, M. Goldberg, G. Shannon, and S. Skiena, “Graph Drawing and Manipulation with LINK,” Proc. Symp. Graph Drawing GD '97, pp. 425437, 1999.
[9] F. Bertault, “A ForceDirected Algorithm that Preserves Edge Crossing Properties,” Proc. Symp. Graph Drawing, GD '99, pp. 351358, 1999.
[10] J. Blythe, C. McGrah, and D. Krackhardt, “The Effect of Graph Layout on Inference from Social Network Data,” Proc. Symp. Graph Drawing, GD '95, pp. 4051, 1995.
[11] R.A. Botafogo, E. Rivlin, and B. Schneiderman, “Structural Analysis of Hypertexts: Identifying Hierarchies and Useful Metrics,” ACM Trans. Information Systems, vol. 10, no. 2, 1992.
[12] F.J. Brandenburg, M. Himsolt, and C. Rohrer, “An Experimental Comparison of ForceDirected and Randomized Graph Drawing Algorithms,” Graph Drawing (Proc. GD '95), F.J. Brandenburg, ed., pp. 7687, 1996.
[13] U. Brandes, G. Shubina, and R. Tamassia, “Improving Angular Resolution in Visualizations of Geographic Networks,” Data Visualization '2000, Proc. Joint Eurographics and IEEE TCVG Symp. Visualization, to appear.
[14] U. Brandes and D. Wagner, “A Bayesian Paradigm for Dynamic Graph Layout,” Proc. Symp. Graph Drawing GD '97, pp. 236247, 1997.
[15] G.G. Robertson, S. Card, and W. York, "The WebBook and the Web Forager: An Information Workspace for the World Wide Web," Proc. of SIGCHI 96, ACM Press, New York, 1996, pp. 1117.
[16] Readings in Information Visualization, S.K. Card, J.D. Mackinlay, and B. Shneiderman, eds. Morgan Kaufmann, 1999.
[17] M.S.T. Carpendale, D.J. Cowperthwaite, and F.D. Fracchia, "ThreeDimensional Pliable Surfaces: For Effective Presentation of Visual Information," UIST: Proc. ACM Symp. on User Interface Software and Tech., ACM Press, New York, 1995, pp. 217226.
[18] M.S.T. Carpendale, D.J. Cowperthwaite, F.D. Fracchica, and T. Shermer, “Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons,” Proc. Symp. Graph Drawing GD '95, pp. 127139, 1996.
[19] M.S.T. Carpendale, D.J. Cowperthwaite, and F.D. Fracchia, IEEE Computer Graphics and Applications, special issue on information visualization, vol. 17, no. 4, pp. 4251, July 1997.
[20] J. Carrière and R. Kazman, “Research Report: Interacting with Huge Hierarchies: Beyond Cone Trees,” Proc. IEEE Conf. Information Visualization '95, pp. 7481, 1995.
[21] C.L. Cesar, Graph Foundation Classes for Java. IBM,ftp.cs.brown.edugdbiblio.tex.Zgdbiblio.ps.Z/ pub/papers/compgeohttp://www.alphaWorks.ibm.com/ techgfc, 1999.
[22] C. Chen and L. Carr, “Visualizing the Evolution of a Subject Domain: A Case Study,” Proc. IEEE Visualization '99 Conf., pp. 449452, 1999.
[23] M. Chuah, “Dynamic Aggregation with Circular Visual Designs,” Proc. IEEE Symp. Information Visualization, pp. 3543, 1998.
[24] M. Chuah et al., "SDM: Malleable Information Graphics," Proc. of Information Visualization 95, IEEE Computer Soc. Press, Los Alamitos, Calif., 1995, pp. 3642.
[25] H.S.M. Coxeter, Introduction to Geometry. John Wiley&Sons, 1973.
[26] I.F. Cruz and R. Tamassia, “Online Tutorial on Graph Drawing,” http://www.cs.brown.edu/people/rt/papers/ gdtutorialgdconstraints.pdf. year?
[27] I.F. Cruz and J.P. Twarog, “3D Graph Drawing with Simulated Annealing,” Proc. Symp. Graph Drawing GD '95, pp. 162165, 1995.
[28] R. Davidson and D. Harel, “Drawing Graphs Nicely Using Simulated Annealing,” ACM Trans. Graphics, vol. 15, no. 4, pp. 301331, 1996.
[29] E. Dengler and W. Cowan, “Human Perception of LaidOut Graphs,” Proc. Symp. Graph Drawing GD '98, pp. 441444, 1998.
[30] A. Denise, M. Vasconcellos, and D.J.A. Welsh, “The Random Planar Graph,” Congressus Numerantium, vol. 113, pp. 6179, 1996.
[31] C. Duncan, M. Goodrich, and S. Kobourov, “Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs,” Lecture Notes in Computer Science, vol. 1547, pp. 111124, 1998.
[32] D. Durand and P. Kahn, “MAPA,” Proc. Ninth ACM Conf. Hypertext and Hypermedia (Hypertext '98), 1998.
[33] P. Eades, “A Heuristic for Graph Drawing,” Congressus Numerantium, vol. 42, pp. 149160, 1984.
[34] P. Eades and K. Sugiyama, “How to Draw a Directed Graph,” J. Information Processing, vol. 13, no. 4, pp. 424434, 1990.
[35] P. Eades, “Drawing Free Trees,” Bulletin of the Inst. for Combinatorics and Its Applications, pp. 1036, 1992.
[36] P. Eades and S.H. Whitesides, “Drawing Graphs in Two Layers,” Theoretical Computer Science, vol. 131, no. 2, pp. 361374, 1994.
[37] P. Eades and Q.W. Feng, “Multilevel Visualization of Clustered Graphs,” Proc. Graph Drawing '96, pp. 101112, 1996.
[38] P. Eades, M.E. Houle, and R. Webber, “Finding the Best Viewpoints for ThreeDimensional Graph Drawings,” Proc. Symp. Graph Drawing GD '97, pp. 8798, 1998.
[39] S.G. Eick, “A Visualization Tool for Y2K,” Computer, vol. 31, no. 10, pp. 63–69, 1998.
[40] J. Eklund, J. Sawers, and R. Zeiliger, “NESTOR Navigator: A Tool for the Collaborative Construction of Knowledge through Constructive Navigation,” Proc. Ausweb '99, Fifth Australian World Wide Web Conf., 1999.
[41] B. Everitt, Cluster Analysis, first ed. Heinemann Educational Books Ltd., 1974.
[42] K.M. Fairchild, S.E. Poltrock, G.W. Furnas, “SemNet: ThreeDimensional Representation of Large Knowledge Bases,” Cognitive Science and Its Applications for HumanComputer Interaction, pp. 201233, Lawrence Erlbaum Assoc., 1988.
[43] K.M. Fairchild, “Information Management Using Virtual RealityBased Visualisations,” Virtual Reality: Application and Explorations, Academic Press, 1993.
[44] A. Formella and J. Keller, “Generalized Fisheye Views of Graphs,” Proc. Symp. Graph Drawing GD '95, pp. 242253, 1995.
[45] M. Forster, A. Pick, and M. Raitner, Graph Template Library, Univ. of Passau,http://infosun.fmi.unipassau.deGTL/, 1999.
[46] E. Frécon and G. Smith, "WebPath: A ThreeDimensional Web History," IEEE Symp. Information Visualization (InfoVis 98), IEEE Press, Piscataway N.J., 1998.
[47] A. Frick, A. Ludwig, and H. Mehldau, “A Fast Adaptive Layout Algorithm for Undirected Graphs,” Proc. Symp. Graph Drawing GD '93, pp. 389403, 1994.
[48] M. Fröhlich and M. Werner, “Demonstration of the Interactive Graph Visualization System da Vinci,” Proc. DIMACS Workshop Graph Drawing '94, 1995.
[49] T. Fruchterman and E. Reingold, “Graph Drawing by ForceDirected Placement,” Software–Practice and Experience, vol. 21, no. 11, pp. 1129–1164, 1991.
[50] G.W. Furnas, "Generalized Fisheye Views," Proc. CHI '86, AddisonWesley, Reading, Mass., 1986, pp. 1623.
[51] G.W. Furnas and B.B. Bederson, "SpaceScale Diagrams: Understanding Multiscale Interfaces," CHI 95: Proc. ACM Conf. on HumanComputer Interaction, ACM Press, New York, 1995, pp. 234241.
[52] G.W. Furnas and X. Zhang, “MuSE: A MultiScale Editor,” Proc. UIST '98 Symp., 1998.
[53] M.R. Garey and D.S. Johnson, “Crossing Number is NPComplete,” SIAM J. Algebraic and Discrete Methods, vol. 4, no. 3, pp. 312316, 1983.
[54] A. Garg and R. Tamassia, "On the Computational Complexity of Upward and Rectilinear Planarity Testing," Proc. 1994 Symp. Graph Drawing (GD '94), pp. 286297, 1994.
[55] Graph Drawing Toolkit. Third Univ. of Rome,http://www.dia.uniroma3.it~gdt/, 1999.
[56] C. Gunn, “Visualizing Hyperbolic Space,” Proc. Eurographics Workshop Computer Graphics and Math., pp. 299313, 1992.
[57] B. Hausmann, B. Slopianka, and H.P. Seidel, “Exploring Plane Hyperbolic Geometry,” Proc. Workshop Visualization and Math., pp. 2136, 1998.
[58] T. He, “InternetBased FrontEnd to Network Simulator,” Data Visualization '99, Proc. Joint Eurographics and IEEE TCVG Symp. Visualization, pp. 247252, 1999.
[59] M. Hemmje, C. Kunkel, and A. Willet, "LyberWorld—A Visualization User Interface Supporting Full Text Retrieval," Proc. of 17th Annual ACM SIGIR Conference, ACM Press, New York, July 1994, pp. 249259.
[60] R.J. Hendley et al., “Narcissus: Visualising Information,” Proc. IEEE Symp. Information Visualization, pp. 9096, 1995.
[61] I. Herman, M. Delest, and G. Melançon, “Tree Visualization and Navigation Clues for Information Visualization,” Computer Graphics Forum, vol. 17, no. 2, pp. 153165, 1998.
[62] I. Herman, M.S. Marshall, G. Melançon, D.J. Duke, M. Delest, and J.P. Domenger, “Skeletal Images as Visual Cues in Graphs Visualization,” Data Visualization '99, Proc. Joint Eurographics and IEEE TCVG Symp. Visualization, pp. 1322, 1999.
[63] I. Herman, G. Melançon, M.M. de Ruiter, and M. Delest, “Latour—A Tree Visualization System,” Proc. Symp. Graph Drawing GD '99, pp. 392399, 1999. A more detailed version in: Reports of the Centre for Math. and Computer Sciences, Report number INSR9904, available at:, 1999.
[64] I. Herman, M.S. Marshall, and G. Melançon, “An ObjectOriented Design for Graph Visualization,” Reports of the Centre for Math. and Computer Sciences, Report no. INSR0001, available at:, 2000.
[65] I. Herman and M.S. Marshall, “GraphXML,” Reports of the Centre for Math. and Computer Sciences, available at:http://www.cwi.nl/InfoVisu/papers/LatourOverview.pdfhttp:/ /www.cwi.nl/InfoVisu/ GVF/GVF.pdfhttp://www.cwi.nl/InfoVisu/GVF/ GraphXMLGraphXML.pdf, 1999.
[66] M. Himsolt, GML—Graph Modelling Language, Univ. of Passau,http://infosun.fmi.unipassau.de/Graphlet GML/, 1997.
[67] J. Hopcroft and R. Tarjan,“Efficient planarity testing,” J. of ACM., vol. 21, no. 4, pp. 549568, 1974.
[68] M.L. Huang, P. Eades, and J. Wang, “Online Animated Graph Drawing Using a Modified Spring Algorithm,” J. Visual Languages and Computing, vol. 9, no. 6, 1998.
[69] M.L. Huang, P. Eades, and R.F. Cohen, “WebOFDAV—Navigating and Visualizing the Web OnLine with Animated Context Swapping,” Proc. Seventh World Wide Web Conf., pp. 636638, 1998.
[70] M.L. Huang and P. Eades, “A Fully Animated Interactive System for Clustering and Navigating Huge Graphs,” Proc. Symp. Graph Drawing GD '98, pp. 374383, 1998.
[71] C. Jeong and A. Pang, “Reconfigurable Disc Trees for Visualizing Large Hierarchical Information Space,” Proc. Information Visualization '98, pp. 1925, 1998.
[72] B. Johnson and B. Shneiderman, “Treemaps: A SpaceFilling Approach to the Visualization of Hierarchical Information,” Proc. Visualization '91 Conf., pp. 284291, 1991.
[73] M. Juenger and P. Mutzel, “2Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms,” J. Graph Algorithms and Applications, vol. 1, pp. 3359, 1997.
[74] D. Jungnickel, Graphs, Networks and Algorithms. Springer Verlag, 1999.
[75] T. Kamada and S. Kawai, “An Algorithm for Drawing General Undirected Graphs,” Information Processing Letters, vol. 31, pp. 715, 1989.
[76] K. Kaugers, J. Reinfelds, and A. Brazma, "A Simple Algorithm for Drawing Large Graphs on Small Screens," Graph Drawing 94, Lecture Notes in Computer Science, SpringerVerlag, Berlin, 1994, pp. 278282.
[77] T. Keahey and E. Robertson, Nonlinear Magnification Fields Proc. IEEE Symp. Information Visualization, pp. 5158, 1997.
[78] D. Kimelman, B. Leban, T. Roth, and D. Zernik, “Reduction of Visual Complexity in Dynamic Graphs,” Proc. Symp. Graph Drawing GD '93, 1994.
[79] M.R. Laguna, R. Martí, and V. Vals, “Arc Crossing Minimization in Hierarchical Digraphs with Tabu Search,” Computers and Operations Research, vol. 24, no. 12, pp. 1,1651,186, 1997.
[80] M. Laguna and R. Martí, “GRASP and Path Relinking for 2Layer Straight Line Crossing Minimization,” INFORMS J. Computing, vol. 11, pp. 4452, 1999.
[81] M. Laguna and R. Martí, “Heuristics and MetaHeuristics for 2Layer Straight Line Crossing Minimization,” URL:http://wwwbus.colorado.edu/FacultyLaguna /, 1999.
[82] J. Lamping, R. Rao, and P. Pirolli, “A Focus + Context Technique Based on Hyperbolic Geometry for Visualizing Large Hierarchies,” Proc. Human Factors in Computing Systems CHI '95 Conf., pp. 401408, 1995.
[83] J. Lamping and R. Rao, “The Hyperbolic Browser: A Focus+context Technique for Visualizing Large Hierarchies,” J. Visual Languages and Computing, vol. 7, no. 1, pp. 3355, 1996.
[84] Y.K. Leung and M.D. Apperley, "A Review and Taxonomy of DistortionOriented Presentation Techniques," ACM Trans. on CHI, Vol. 1, No. 2, 1994, pp. 126160.
[85] K.L. Ma, "Image Graphs: A Novel Approach to Visual Data Exploration," Proc. Visualization 99 Conf., Oct. 1999, ACM Press, New York, pp. 8188.
[86] M. McGrath, J. Blythe, and D. Krackhardt, “The Effect of Spatial Arrangement on Judgments and Errors in Interpreting Graphs,” Social Networks, vol. 19, no. 3, pp. 223242, 1997.
[87] G. Melançon and I. Herman, “Circular Drawings of Rooted Trees,” Reports of the Centre for Math. and Computer Sciences, report number INS–9817, available at:, 1998.
[88] K. Mehlhorn and P. Mutzel, “On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm,” Algorithmica, vol. 16, pp. 233242, 1996.
[89] B. Mirkin, Mathematical Classification and Clustering. Kluwer Academic, 1996.
[90] K. Misue, P. Eades, W. Lai, and K. Sugiyama, “Layout Adjustment and the Mental Map,” J. Visual Languages and Computing, vol. 6, pp. 183210, 1995.
[91] S. Mukherjea, J.D. Foley, and S. Hudson, “Visualizing Complex Hypermedia Networks through Multiple Hierarchical Views,” Human Factors in Computing Systems, CHI '95 Conf. Proc., pp. 331337, 1995.
[92] T. Munzner and P. Burchard, “Visualizing the Structure of the World Wide Web in 3D Hyperbolic Space,” Proc. VRML '95 Symp., pp. 3338, 1995.
[93] T. Munzner, "H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space," Proc. 1997 IEEE Symp. Information Visualization, IEEE CS Press, Los Alamitos, Calif., 1997, pp. 210; .
[94] T. Munzner, "Drawing Large Graphs with H3Viewer and Site Manager," Proc. Graph Drawing 98, SpringerVerlag, New York, Aug. 1998, pp. 384393.
[95] T. Munzner, F. Guimbretière, and G. Robertson, “Constellation: A Visualization Tool for Linguistic Queries from MindNet,” Proc. IEEE Symp. Information, InfoVis '99, pp. 132135, 1999.
[96] P. Mutzel, C. Gutwengwer, R. Brockenauer, S. Fialko, G. Klau, M. Kruger, T. Ziegler, S. Naher, D. Alberts, D. Ambras, G. Koch, M. Junger, C. Bucheim, and S. Leipert, “A Library of Algorithms for Graph Drawing,” Proc. Symp. Graph Drawing GD '97 Symp., pp. 456457, 1998.
[97] T. Munzner, E. Hoffman, K. Claffy, and B. Fenner, “Visualizing the Global Topology of the MBone,” Proc. IEEE Symp. Information Visualization, 1996.
[98] L. Nigay and F. Vernier, “Design Method of Interaction Techniques for Large Information Space,” Proc. Advanced Visual Interfaces (AVI '98), 1998.
[99] S. North, “Incremental Layout in DynaDAG,” Proc. Symp. Graph Drawing GD '95, pp. 409418, 1995.
[100] H.C. Purchase, “Which Aesthetic Has the Greatest Effect on Human Understanding?” Proc. Symp. Graph Drawing GD '97, pp. 248261, 1998.
[101] H.C. Purchase, R.F. Cohen, and M. James, “Validating Graph Drawing Aesthetics,” Proc. Symp. Graph Drawing GD '95, pp. 435446, 1995.
[102] H.C. Purchase, R.F. Cohen, and M. James, “An Experimental Study of the Basis for Graph Drawing Algorithms,” ACM J. Experimental Algorithmics, vol. 2, no. 4, 1997.
[103] E.M. Reingold and J.S. Tilford, “Tidier Drawing of Trees,” IEEE Trans. Software Eng., vol. 7, no. 2, pp. 223228, 1981.
[104] J. Rekimoto and M. Green, “The Information Cube: Using Transparency in 3D Information Visualization,” Proc. Third Ann. Workshop Information Technologies&Systems (WITS '93), 1993.
[105] J.S. Risch, D.B. Rex, S.T. Dowson, T.B. Walters, R.A. May, and B.D. Moon, “The STARLIGHT Information Visualization System,” Proc. IEEE Conf. Information Visualization, pp. 4249, 1997.
[106] G.G. Robertson, J.D. Mackinlay, and S.K. Card, "Cone Trees: Animated 3D Visualizations of Hierarchical Information," Proc. ACM Conf. Human Factors in Computer Systems (CHI 91), ACM Press, 1991, pp. 189194.
[107] G.G. Robertson, S.K. Card, and J.D. Mackinlay, "Information Visualization Using 3D Interactive Animation," Comm. ACM, Vol. 36, No. 4, 1993, pp. 5771.
[108] A. Robinson, EBI Hyperbolic Viewer. European Bioinformatics Inst., available at:http://www.cwi.nl/InfoVisu/papers/circular.pdfhttp:/ /graphics.stanford.edu/papers/ h3http://industry.ebi.ac.uk/~alancomponents , 1998.
[109] T. Roxborough and A. Sen, “Graph Clustering Using Multiway Ratio Cut,” Proc. Symp. Graph Drawing GD '97, pp. 291296, 1998.
[110] M. Sarkar and M. Brown, "Graphical FishEye Views of Graphs," Proc. CHI '92: Human Factors in Computing Systems.New York N.Y.: ACM Press, pp. 8392, 1992.
[111] M. Sarkar and M. Brown, “Graphical Fisheye Views,” Comm. ACM, vol. 37, no. 12, pp. 7384, 1994.
[112] D. Schaffer, Z. Zuo, S. Greenberg, L. Bartram, J. Dill, S. Dubs, and M. Roseman, “Navigating Hierarchically Clustered Networks Through Fisheye and FullZoom Methods,” ACM Trans. Computer–Human Interaction, vol. 3, no. 2, pp. 162–188, 1996.
[113] Y. Shiloach, “Arrangements of Planar Graphs on the Planar Lattices,” PhD thesis, Weizmann Inst. of Science, Rehovot, Israel, 1976.
[114] H. Shiozawa, K.i. Okada, and Y. Matsushita, “3D Interactive Visualization for InterCell Dependencies of Spreadsheets,” Proc. IEEE Symp. Information Visualization (InfoViz '99), pp. 7982, 1999.
[115] G. Sindre, B. Gulla, and H.G. Jokstad, “Onion Graphs: Aesthetics and Layout,” Proc. IEEE/CS Symp. Visual Languages (VL '93), pp. 287291, 1993.
[116] T.C. Sprenger, M. Gross, D. Bielser, and T. Strasser, “IVORY—An ObjectOriented Framework for PhysicsBased Information Visualization in Java,” Proc. IEEE Symp. Information Visualization (InfoViz '98), 1998.
[117] K. Sugiyama, S. Tagawa, and M. Toda, “Methods for Visual Understanding of Hierarchical Systems Structures,” IEEE Trans. Systems, Man, and Cybernetics, vol. 11, no. 2, pp. 109125, 1989.
[118] K. Sugiyama and K. Misue, “Visualization of Structural Information: Automatic Drawing of Compound Digraphs,” IEEE Trans. Systems, Man, and Cybernetics, vol. 21, no. 4, pp. 876892, 1991.
[119] W. Tutte, “How to Draw a Graph,” Proc. London Math. Soc., vol. 3, no. 13, pp. 743768, 1963.
[120] X.G. Viennot, “Trees Everywhere,” Proc. 15th CAAP Conf., pp. 1841, 1990.
[121] J.Q. Walker II, “A NodePositioning Algorithm for General Trees,” Software—Practice and Experience, vol. 20, no. 7, pp. 685705, 1990.
[122] C. Ware and G. Franck, "Evaluating Stereo and Motion Cues for Visualizing Information Nets in Three Dimensions, " ACM Trans. Graphics, vol. 15, no. 2, 1996, pp. 121139.
[123] C. Ware, Information Visualization: Perception for Design. San Diego, Calif.: Academic Press, 2000.
[124] Y. Wei and C. Cheng, “Ratio Cut Partitioning for Hierarchical Designs,” IEEE Trans. ComputerAided Design, vol. 10, no. 7, July 1991.
[125] J.J. van Wijk and H. van de Wetering, “Cushion Treemaps: Visualization of Hierarchical Information,” Proc. IEEE Symp. Information Visualization (InfoViz '99), pp. 7378, 1999.
[126] G.J. Wills, "Nicheworks—Interactive Visualization of Very Large Graphs," Proc. Graph Drawing 97, Lecture Notes in Computer Science, SpringerVerlag, Berlin, 1997.
[127] R.M. Wilson and R.D. Bergeron, “Dynamic Hierarchy Specification and Visualization,” Proc. IEEE Information Visualization '99, G. Wills and D. Keim, eds., Oct. 1999.
[128] P. Young, “Three Dimensional Information Visualization (Survey),” Computer Science Technical Report, Centre for Software Maintenance Dept. of Computer Science, Univ. of Durham, available at:http://www.dur.ac.uk/~dcs3py/pages/work/ documents/litsurvey/IVSurveyindex.html , 1996.
[129] J.D. ZapataRivera, E. Neufeld, and J.E. Greer, “Visualization of Bayesian Belief Networks,” Proc. IEEE Visualization '99, Late Breaking Hot Topics, pp. 8588, 1999.
[130] R. Zeiliger, “Supporting Constructive Navigation of Web Space,” Proc. Workshop Personalized and Solid Navigation in Information Space, 1998.