TopoLayout: Multilevel graph layout by topological features

IEEE Transactions on Visualization and Computer Graphics

Volumn 13, Issue 2, 2007, Pages 305-316

  Archambault, Daniel ^b   Munzner, Tamara ^a,b   Auber, David ^c  

^a IEEE   (Canada)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Graph visualization; Graphs and networks; Information visualization

Indexed keywords

DATA SETS; GRAPH VISUALIZATION; GRAPHS; VISUAL QUALITY;

ALGORITHMS; COMPUTER NETWORKS; FEATURE EXTRACTION; GRAPH THEORY; INFORMATION ANALYSIS; TOPOLOGY;

COMPUTER GRAPHICS;

ALGORITHM; ARTICLE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; COMPUTER GRAPHICS; COMPUTER INTERFACE; COMPUTER PROGRAM; METHODOLOGY;

ALGORITHMS; COMPUTER GRAPHICS; IMAGE INTERPRETATION, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; SOFTWARE; USER-COMPUTER INTERFACE;

EID: 33846617291     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2007.46     Document Type: Article

References (31)

1. J. Abello, S.G. Kobourov, and R. Yusufov, "Visualizing Large Graphs with Compound-Fisheye Views and Treemaps," Proc. 12th Int'l Symp. Graph Drawing, pp. 431-441, 2004.
2. D. Archambault, T. Munzner, and D. Auber, "TopoLayout: Graph Layout by Topological Features," Proc. IEEE Information Visualization Posters Compendium (InfoVis '05), pp. 3-4, 2005.
3. D. Auber, "Tulip: A Huge Graph Visualization Framework," Graph Drawing Software, Math. and Visualization, P. Mutzel and M. Jünger, eds., pp. 105-126, Springer-Verlag, 2003.
4. D. Auber, Y. Chiricota, F. Jourdan, and G. Melancon, "Multiscale Visualization of Small World Networks," Proc. IEEE Symp. Information Visualization (InfoVis '03), pp. 75-81, 2003.
5. S. Baase and A. Van Gelder, Computer Algorithms: Introduction to Design and Analysis, third ed. Addison-Wesley, 2000.
6. C. Buchheim, M. Jünger, and S. Leipert, "Improving Walker's Algorithm to Run in Linear Time," Proc. Graph Drawing Conf. (GD '02), pp. 344-353, 2002.
7. R. Davidson and D. Harel, "Drawing Graphs Nicely Using Simulated Annealing," ACM Trans. Graphics, vol. 15, no. 4, pp. 301-331, 1996.
8. T. Dwyer, K. Marriott, and P.J. Stuckey, "Fast Node Overlap Removal," Proc. 13th Int'l Symp. Graph Drawing, 2005.
9. T. Dwyer, K. Marriott, and P.J. Stuckey, "Fast Node Overlap Removal," technical report, School of Computer Science & Software Eng., Monash Univ., Australia, Aug. 2005.
10. P. Eades, "A Heuristic for Graph Drawing," Congressus Numerantium, vol. 42, pp. 149-160, 1984.
11. A. Frick, A. Ludwig, and H. Mehldau, "A Fast Adaptive Layout Algorithm for Undirected Graphs," Proc. Graph Drawing Conf. (GD '94), pp. 388-403, 1995.
12. T.M.J. Fruchterman and E.M. Reingold, "Graph Drawing by Force-Directed Placement," Software - Practice and Experience, vol. 21, no. 11, pp. 1129-1164, Nov. 1991.
13. P. Gajer and S.G. Kobourov, "GRIP: Graph Drawing with Intelligent Placement," J. Graph Algorithms and Applications, vol. 6, no. 3, pp. 203-224, 2002.
14. E. Gansner, Y. Koren, and S. North, "Topological Fisheye Views for Visualizing Large Graphs," IEEE Trans. Visualization and Computer Graphics, vol. 11, no. 4, pp. 457-468, 2005.
15. S. Grivet, D. Auber, J. Domenger, and G. Melancon, "Bubble Tree Drawing Algorithm," Proc. Int'l Conf. Computer Vision and Graphics, pp. 633-641, 2004.
16. S. Hachul and M. Jünger, "Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm," Proc. 12th Int'l Symp. Graph Drawing, pp. 285-295, 2004.
17. S. Hachul and M. Jünger, "An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs," Proc. 13th Int'l Symp. Graph Drawing, 2005.
18. D. Harel and Y. Koren, "Drawing Graphs with Non-Uniform Vertices," Proc. Working Conf. Advanced Visual Interfaces (AVI '02), pp. 157-166, 2002.
19. D. Harel and Y. Koren, "A Fast MultiScale Method for Drawing Large Graphs," J. Graph Algorithms and Applications, vol. 6, pp. 179-202, 2002.
20. T. Kamada and S. Kawai, "An Algorithm for Drawing General Undirected Graphs," Information Processing Letters, vol. 31, pp. 7-15, 1989.
21. Y. Koren, L. Carmel, and D. Harel, "Drawing Huge Graphs by Algebraic Multigrid Optimization," Multiscale Modeling and Simulation, vol. 1, no. 4, pp. 645-673, 2003.
22. Y. Koren and D. Harel, "Graph Drawing by High-Dimensional Embedding," Proc. Graph Drawing Conf. (GD '02), pp. 207-219, 2002.
23. D.C. Lay, Linear Algebra and Its Applications, third ed. Addison-Wesley, 1997.
24. K.A. Lyons, H. Meijer, and D. Rappaport, "Algorithms for Cluster Busting in Anchored Graph Drawing," J. Graph Algorithms and Applications, vol. 2, no. 1, 1998.
25. O. Niggemann and B. Stein, "A Meta Heuristic for Graph Drawing. Learning the Optimal Graph-Drawing Method for Clustered Graphs," Proc. Working Conf. Advanced Visual Interfaces (AVI '00), pp. 286-289, 2000.
26. E.L. Schwartz, A. Shaw, and E. Wolfson, "A Numerical Solution to the Generalized Mapmaker's Problem: Flattening Nonconvex Polyhedral Surfaces," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 9, pp. 1005-1008, Sept. 1989.
27. J.M. Six and I.G. Tollis, "A Framework for Circular Drawings of Networks," Proc. Graph Drawing Conf. (GD '99), pp. 107-116, 1999.
28. A. Symeonidis and I.G. Tollis, "Visualization of Biological Information with Circular Drawings," Proc. Int'l Symp. Medical Data Analysis (ISBMDA '04), pp. 468-478, 2004.
29. F. van Ham and J. van Wijk, "Interactive Visualization of Small World Graphs," Proc. IEEE Symp. Information Visualization (InfoVis '04), pp. 199-206, 2004.
30. C. Walshaw, "A Multilevel Algorithm for Force-Directed Graph Drawing," J. Graph Algorithms, vol. 7, no. 3, pp. 253-285, 2003.
31. G. Zigelman, R. Kimmel, and N. Kiryati, "Texture Mapping Using Surface Flattening via Multidimensional Scaling," IEEE Trans. Visualization and Computer Graphics, vol. 8, no. 2, pp. 198-207, Apr.-June 2002.