GMap: Visualizing graphs and clusters as maps

IEEE Pacific Visualization Symposium 2010, PacificVis 2010 - Proceedings

Volumn , Issue , 2010, Pages 201-208

  Gansner, Emden R ^a   Hu, Yifan ^a   Kobourov, Stephen ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF ARIZONA   (United States)

Author keywords

G.2 discrete mathematics : Graph theory H.3 : Information storage and retrieval Clustering

Indexed keywords

DIMENSIONAL SPACES; DIMENSIONALITY REDUCTION TECHNIQUES; DISCRETE MATHEMATICS; G.2 [DISCRETE MATHEMATICS]: GRAPH THEORY - [H.3]: INFORMATION STORAGE AND RETRIEVAL - CLUSTERING; HIGH DIMENSIONAL DATA; INFORMATION STORAGE AND RETRIEVAL; INFORMATION VISUALIZATION; LARGE DATASETS; PRACTICAL ALGORITHMS; RELATIONAL DATA; STRUCTURAL INFORMATION;

GRAPH THEORY; INFORMATION SYSTEMS; MATHEMATICAL TECHNIQUES; TREES (MATHEMATICS); VISUALIZATION;

DATA VISUALIZATION;

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

References (38)

1. Karte des Bücherlandes. strangemaps.wordpress.com/2009/04/08.
2. www.research.att.com/~yifanhu/MAPS/.
3. www.touchgraph.com/TGAmazonBrowser.html.
4. Map of online communities. xkcd.com/256.
5. K. Boyack, R. Klavans, and K. Borner. Mapping the backbone of science. Scientometrics, 64(3):351-374, 2005.
6. C. Brewer. Colorbrewer - selecting good color schemes for maps. www.colorbrewer.org.
7. M. Bruls, K. Huizing, and J. van Wijk. Squarified treemaps. In Joint Eurographics and IEEE TCVG Symposium on Visualization, pages 33-42. Press, 1999.
8. H. Byelas and A. Telea. Visualization of areas of interest in software architecture diagrams. In SoftVis'06: Proceedings of the 2006 ACM Symposium on Software Visualization, pages 105-114, 2006. (Pubitemid 350164663)
9. C. Collins, G. Penn, and S. Carpendale. Bubble sets: Revealing set relations with isocontours over existing visualizations. IEEE Transactions on Visualization and Computer Graphics, 15(6):1009-1016, 2009.
10. T. Davis. The University of Florida Sparse Matrix Collection. http://www.cise.ufl.edu/research/sparse/matrices.
11. H. de Fraysseix, P. O. de Mendez, and P. Rosenstiehl. On triangle contact graphs. Combinatorics, Probability and Computing, 3:233-246, 1994.
12. M. B. Dillencourt, D. Eppstein, and M. T. Goodrich. Choosing colors for geometric graphs via color space embeddings. In 14th Symposium on Graph Drawing (GD), pages 294-305, 2006.
13. C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. Yee. GraphAEL: Graph animations with evolving layouts. In 11th Symposium on Graph Drawing, pages 98-110, 2003.
14. S. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153-174, 1987.
15. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force directed placement. Software - Practice and Experience, 21:1129-1164, 1991.
16. E. Gansner, Y. Hu, M. Kaufmann, and S. G. Kobourov. Optimal polygonal representation of planar graphs. In 9th Latin American Theoretical Informatics Symposium, 2010.
17. E. R. Gansner, Y. F. Hu, S. G. Kobourov, and C. Volinsky. Putting recommendations on the map - visualizing clusters and relations. In Proceedings of the 3rd ACM Conference on Recommender Systems. ACM, 2009.
18. E. R. Gansner, Y. Koren, and S. C. North. Graph drawing by stress majorization. In Proc. 12th Intl. Symp. Graph Drawing (GD '04), volume 3383 of LNCS, pages 239-250. Springer, 2004.
19. X. He. On floor-plan of plane graphs. SIAM Journal of Computing, 28(6):2150-2167, 1999.
20. Y. F. Hu. Efficient and high quality force-directed graph drawing. Mathematica Journal, 10:37-71, 2005.
21. Y. F. Hu and J. A. Scott. A multilevel algorithm for wavefront reduction. SIAM Journal on Scientific Computing, 23:1352-1375, 2001.
22. I. T. Jolliffe. Principal Component Analysis. Springer, second edition, October 2002.
23. P. Koebe. Kontaktprobleme der konformen Abbildung. Berichte über die Verhandlungen der Sächsischen Akademie der Wissenschaften zu Leipzig. Math.-Phys. Klasse, 88:141-164, 1936.
24. T. Kohonen. Self-Organizing Maps. Springer, 2000.
25. J. B. Kruskal and M. Wish. Multidimensional Scaling. Sage Press, 1978.
26. G. Kumfert and A. Pothen. Two improved algorithms for envelope and wavefront reduction. BIT, 35:1-32, 1997.
27. I. Y. Liao, M. Petrou, and R. Zhao. A fractal-based relaxation algorithm for shape from terrain image. Computer Vision and Image Understanding, pages 227-243, 2008.
28. S. Lloyd. Last square quantization in pcm. IEEE Transactions on Information Theory, 28:129-137, 1982.
29. F. K. Musgrave. Methods for Realistic Landscape Imaging. PhD thesis, Yale Univeristy, 1993.
30. M. E. J. Newman. Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA, 103:8577-8582, 2006.
31. A. Noack. Modularity clustering is force-directed layout. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 79, 2009.
32. E. Raisz. The rectangular statistical cartogram. Geographical Review, 24(2):292-296, 1934.
33. S. Roweis and L. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290:2323-2326, 2000. (Pubitemid 32041578)
34. B. Shneiderman. Tree visualization with tree-maps: A 2-D space-filling approach. ACM Transactions on Graphics, 11(1):92-99, 1992.
35. P. Simonetto, D. Auber, and D. Archambault. Fully automatic visualisation of overlapping sets. Computer Graphics Forum, 28:967-974, 2009.
36. J. B. Tenenbaum, V. V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000. (Pubitemid 32041577)
37. J. R. R. Tolkien. The Shaping of Middle-Earth. Houghton Mifflin Harcourt, 1986.
38. M. Weskamp. Newsmap. marumushi.com/apps/newsmap, 2004.