A treemap based method for rapid layout of large graphs

IEEE Pacific Visualisation Symposium 2008, PacificVis - Proceedings

Volumn , Issue , 2008, Pages 231-238

  Muelder, Chris ^a   Kwan Liu, Ma ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

I.3.6 computing methodologies : computer graphics methodologies and techniques

Indexed keywords

CLUSTERING HIERARCHY; DATA TYPING; FORCE-DIRECTED METHOD; GRAPH LAYOUT; GRAPH VERTICES; I.3.6 [COMPUTING METHODOLOGIES]: COMPUTER GRAPHICS - METHODOLOGIES AND TECHNIQUES; INTERACTIVE SYSTEMS; ITERATIVE ALGORITHMS; LARGE GRAPHS; NEW APPROACHES; NUMBER OF ITERATIONS; OPTIMAL LAYOUT; OR NETWORKS; SEMANTIC ZOOMING; VISUALISATION;

GRAPH THEORY; INFORMATION THEORY; VISUALIZATION;

ITERATIVE METHODS;

EID: 49749122197     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACIFICVIS.2008.4475481     Document Type: Conference Paper

References (28)

1. Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics, 12(5):741-748, 2006. Danny Holten.
2. J. Abello, S. G. Kobourov, and R. Yusufov. Visualizing large graphs with compound-fisheye views and treemaps. In Graph Drawing, pages 431-441, 2004.
3. M. Balzer and O. Deussen. Voronoi treemaps. In IEEE Symposium on Information Visualization 2005, 2005.
4. M. Bruis, K. Huizing, and J. van Wijk. Squarified treemaps, 2000.
5. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70:066111, 2004.
6. J. D. Cohen. Drawing graphs to convey proximity: An incremental arrangement method. ACM Transactions On Computer-Human Interaction, 4(3):197-229, 1997.
7. Data. 'California' search results graph, http://www.es.Cornell.edu/ Courses/cs685/2002fa/, accessed 12/10/07.
8. Data. Graph of San Francisco Bay Area streets from the 9th dimacs implementation challenge, http://www.dis.uniromal.it/~challenge9/download.shtml, accessed 12/10/07.
9. J.-D. Fekete, D. Wang, N. Dang, A. Aris, and C. Plaisant. Overlaying graph links on treemaps. In InfoVis03, Poster Compendium (Aug. 2003), page 8283, 2003.
10. Y. Frishman and A. Tal. Multi-level graph layout on the gpu. IEEE Trans. Vis. Comput. Graph., 13(6):1310-1319, 2007.
11. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software ?Practice and Experience, 21(11):1129-1164, 1991.
12. E. R. Gansner. Topological fisheye views for visualizing large graphs. IEEE Transactions on Visualization and Computer Graphics, 11(4):457-468, July 2005.
13. S. Hachul and M. Jünger. An experimental comparison of fast algorithms for drawing general large graphs. In Graph Drawing, pages 235-250, 2005.
14. J. Heer and D. Boyd. Vizster: Visualizing online social networks. In IEEE Symposium on Information Visualization 2005, 2005.
15. M. L. Huang and Q. V Nguyen. A fast algorithm for balanced graph clustering. In IV, pages 46-52. IEEE Computer Society, 2007.
16. S. C. Johnson. Hierarchical clustering schemes. In Psychometrika, pages 2:241-254, 1967.
17. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Inf. Process. Lett., 31(1):7-15, 1989.
18. W. Ke, K. Borner, and L. Viswanath. Major information visualization authors, papers and topics in the acm library. In InfoVis04 Contest, 2004.
19. C. Muelder, K.-L. Ma, and T. Bartoletti. A visualization methodology for characterization of network scans. In ACM VizSEC 2005 Workshop, pages 29-38, 2005.
20. Q. V. Nguyen and M. L. Huang. Enccon: an approach to constructing interactive visualization of large hierarchical data. Palgrave Macmillan (online), 2005.
21. A. Noack. An energy model for visual graph clustering. Lecture Notes in Computer Science, 2912:425-436, Mar. 2004.
22. A. Quigley and P. Eades. Fade: Graph drawing, clustering, and visual abstraction. In GD '00: Proceedings of the 8th International Symposium on Graph Drawing, pages 197-210, London, UK, 2001. Springer-Verlag.
23. K. Shi, P. Irani, and B. Li. An evaluation of content browsing techniques for hierarchical space-filling visualizations. In IEEE Symposium on Information Visualization 2005, 2005.
24. B. Shneiderman. Tree visualization with tree-maps: 2-d space-filling approach. ACMTrans. Graph., 11(1):92-99, 1992.
25. C. Walshaw. A multilevel algorithm for force-directed graph drawing. In J. Marks, editor, Proc. 8th Int. Symp. Graph Drawing, GD, volume 1984, pages 171-182. Springer-Verlag, 20-23 2000.
26. X. Wang and I. Miyamoto. Generating customized layouts. In F. J. Brandenburg, editor, Graph Drawing, Passou, Germany, September 20-22, 1995, pages pp. 504-515. Springer, 1996.
27. J. H. Ward. Hierarchical grouping to optimize an objective function. Journal of American Statistical Association, 58(301):236-244, 1963.
28. S. Zhao, M. J. McGuffin, and M. H. Chignell. Elastic hierarchies: Combining treemaps and node-link diagrams. In IEEE Symposium on Information Visualization 2005, 2005.