Rapid graph layout using space filling curves

IEEE Transactions on Visualization and Computer Graphics

Volumn 14, Issue 6, 2008, Pages 1301-1308

  Muelder, Chris ^a   Kwan Liu, Ma ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Graph layout; Information visualization; Space filling curves

Indexed keywords

COLOCATION; GRAPH LAYOUT; GRAPH LAYOUT ALGORITHMS; GRAPH LAYOUTS; INFORMATION VISUALIZATION; NETWORK DATUM; NEW APPROACHES; SPACE FILLING CURVES; SPACE FILLINGS;

COMPUTATIONAL COMPLEXITY; INFORMATION SYSTEMS; JAVA PROGRAMMING LANGUAGE; NETWORK PROTOCOLS; SENSOR NETWORKS;

GRAPH THEORY;

EID: 54949092423     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2008.158     Document Type: Conference Paper

References (34)

1. Boost graph library's OVA: http://boost.org/libs/graph/doc/ fruchterman_reingold.html.
2. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70:066111, 2004.
3. J. D. Cohen. Drawing graphs to convey proximity: An incremental arrangement method. ACM Transactions On Computer-Human Interaction, 4(3): 197-229, 1997.
4. Data. 'California' search results graph, http://www.cs.cornell.edu/ Courses/cs685/2002fa/, accessed 12/10/07.
5. Data. Graph of Florida streets from the 9th dimacs implementation challenge, http://www.dis.uniromal.it/~challenge9/download.shtml, accessed 12/10/07.
6. 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.
7. Data. Protein homology graph from Large Graph Layout project site, http://bioinformatics.icmb.utexas.edu/lgl/, accessed 12/10/07.
8. N. Elmqvist, T.-N. Do, H. Goodell, N. Henry, and J.-D. Fekete. Zame: Interactive large-scale graph visualization. In Proceedings of IEEE VGTC Pacific Visualization Symposium (PacificVis), 2008.
9. Y. Frishman and A. Tal. Multi-level graph layout on the gpu. IEEE Transactions on Visualization and Computer Graphics, 13(6): 1310-1319, 2007.
10. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software - Practice and Experience, 21(11):1129-1164, 1991.
11. P. Gajer and S. G. Kobourov. Grip: Graph drawing with intelligent placement. In International Symposium on Graph Drawing, pages 222-228, London, UK, 2001. Springer-Verlag.
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. A Potential-Field-Based Multilevel Algorithm for Drawing Large Graphs. PhD thesis, Universitaet zu Koeln, 2002.
14. S. Hachul and M. Jünger. An experimental comparison of fast algorithms for drawing general large graphs. In International Symposium on Graph Drawing, pages 235-250, 2005.
15. D. Harel and Y. Koren. Graph drawing by high-dimensional embedding. In International Symposium on Graph Drawing, pages 207-219, London, UK, 2002. Springer-Verlag.
16. J. Heer and d. boyd. Vizster: Visualizing online social networks. In Proceedings of the 2005 IEEE Symposium on Information Visualization (InfoVis), 2005.
17. J. Heidemann, Y. Pradkin, R. Govindan, C. Papadopoulos, G. Bartlett, and J. Bannister. Census and survey of the visible internet (extended). technical report isi-tr-2008-649, use/information sciences institute, february, 2008.
18. M. L. Huang and Q. V. Nguyen. A fast algorithm for balanced graph clustering. Proceedings of the 2007 IEEE Symposium on Information Visualization (InfoVis), pages 46-52, 2007.
19. B. Irwin and N. Pilkington. High level internet level traffic visualization using hilbert curve mapping. In ACM VizSEC 2005 Workshop, pages 29-38, 2005.
20. S. C. Johnson. Hierarchical clustering schemes. In Psychometrika, pages 2:241-254, 1967.
21. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Inf. Process. Lett., 31(1):7-15, 1989.
22. W. Ke, K. Borner, and L. Viswanath. Major information visualization authors, papers and topics in the acm library. In InfoVis04 Contest, 2004.
23. Y. Korens algorithm implementations (ACE and HDE): http://research.att. com/~yehuda/index-programs.html.
24. Y. Koren, L. Carmel, and D. Harel. Ace: A fast multiscale eigenvectors computation for drawing huge graphs. Proceedings of the 2002 IEEE Symposium on Information Visualization (InfoVis), 00:137, 2002.
25. C. Muelder and K.-L. Ma. A treemap based method for rapid layout of large graphs. In Proceedings of IEEE VGTC Pacific Visualization Symposium (PacificVis), 2008.
26. 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.
27. C. Mueller, B. Martin, and A. Lumsdaine. A comparison of vertex ordering algorithms for large graph visualization. Visualization, 2007. APVIS '07. 2007 6th International Asia-Pacific Symposium on, pages 141-148, 5-7 Feb. 2007.
28. R. Munroe. Map of the internet, http://www.xkcd.com/195/.
29. P. Neumann, M. S. T. Carpendale, and A. Agarawala. Phyllotrees: Phyllotactic patterns for tree layout. In EuroVis, pages 59-66, 2006.
30. A. Noack. An energy model for visual graph clustering. Lecture Notes in Computer Science, 2912:425-436, Mar. 2004.
31. The open graph drawing framework: http://www.ogdf.net/.
32. A. Tikhonova and K.-L. Ma. A scalable parallel force-directed graph layout algorithm. In Proceedings of Parallel Gmphics and Visualization Symposium, April 2008.
33. M. Wattenberg. A note on space-filling visualizations and space-filling curves. In Proceedings of the 2005 IEEE Symposium on Information Visualization (InfoVis), page 24, Washington, DC, USA, 2005. IEEE Computer Society.
34. R. Yusufovs implementation of GRIP: http://www.cs.arizona.edu/~kobourov/ GRIP.