Abstract
We describe MapSets, a method for visualizing embedded and clustered graphs. The proposed method relies on a theoretically sound geometric algorithm, which guarantees the contiguity and disjointness of the regions representing the clusters, and also optimizes the convexity of the regions. A fully functional implementation is available online and is used in a comparison with related earlier methods.
Chapter PDF
References
Agarwal, P.K., Edelsbrunner, H., Schwarzkopf, O., Welzl, E.: Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Comput. Geom. 6(1), 407–422 (1991)
Alper, B., Riche, N.H., Ramos, G., Czerwinski, M.: Design study of LineSets, a novel set visualization technique. IEEE Trans. Vis. Comput. Graphics 17(12), 2259–2267 (2011)
Arora, S., Chang, K.: Approximation schemes for degree-restricted MST and red–blue separation problems. Algorithmica 40(3), 189–210 (2004)
Boyack, K.W., Klavans, R., Börner, K.: Mapping the backbone of science. Scientometrics 64, 351–374 (2005)
Chung, F., Graham, R.: A new bound for Euclidean Steiner minimal trees. Annals of the New York Academy of Sciences 440(1), 328–346 (1985)
Collins, C., Penn, G., Carpendale, S.: Bubble sets: Revealing set relations with isocontours over existing visualizations. IEEE Trans. Vis. Comput. Graphics 15(6), 1009–1016 (2009)
Dinkla, K., van Kreveld, M.J., Speckmann, B., Westenberg, M.A.: Kelp diagrams: Point set membership visualization. Comput. Graph. Forum 31(3, pt1), 875–884 (2012)
Dwyer, T., Nachmanson, L.: Fast edge-routing for large graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 147–158. Springer, Heidelberg (2010)
Hu, Y., Gansner, E.R., Kobourov, S.G.: Visualizing graphs and clusters as maps. IEEE Comput. Graphics and Appl. 30(6), 54–66 (2010)
Hurtado, F., Korman, M., van Kreveld, M., Löffler, M., Sacristán, V., Silveira, R.I., Speckmann, B.: Colored spanning graphs for set visualization. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 280–291. Springer, Heidelberg (2013)
Jianu, R., Rusu, A., Hu, Y., Taggart, D.: How to display group information on node-link diagrams: An evaluation. IEEE Trans. Vis. Comput. Graphics 20(11), 1530–1541 (2014)
Kanizsa, G., Gerbino, W.: Convexity and symmetry in figure-ground organization. Vision and Artifact, 25–32 (1976)
Kobourov, S.G., Pupyrev, S., Simonetto, P.: Visualizing graphs as maps with contiguous regions. Comput. Graph. Forum (2014)
Kratochvíl, J., Nešetřil, J.: Independent set and clique problems in intersection-defined classes of graphs. Commentationes Math. Univ. Carolinae 31(1), 85–93 (1990)
Meulemans, W., Riche, N., Speckmann, B., Alper, B., Dwyer, T.: KelpFusion: A hybrid set visualization technique. IEEE Trans. Vis. Comput. Graphics 19(11), 1846–1858 (2013)
Mitchell, J.S.: Geometric shortest paths and network optimization. Handbook of Computational Geometry 334, 633–702 (2000)
Novembre, et al.: Genes mirror geography within Europe. Nature 456(7218), 98–101 (2008)
Pupyrev, S., Nachmanson, L., Bereg, S., Holroyd, A.E.: Edge routing with ordered bundles. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 136–147. Springer, Heidelberg (2011)
Purves, D., Lotto, R.B.: Why we see what we do: An empirical theory of vision. Sinauer Associates (2003)
Riche, N.H., Dwyer, T.: Untangling Euler diagrams. IEEE Trans. Vis. Comput. Graphics 16(6), 1090–1099 (2010)
Simonetto, P., Auber, D., Archambault, D.: Fully automatic visualisation of overlapping sets. Comput. Graph. Forum 28(3), 967–974 (2009)
Skupin, A., Fabrikant, S.I.: Spatialization methods: a cartographic research agenda for non-geographic information visualization. Cartogr. Geogr. Inform. 30, 95–119 (2003)
Sonka, M., Hlavac, V., Boyle, R.: Image Processing, Analysis, and Machine Vision. Thomson-Engineering (2007)
Zunic, J., Rosin, P.L.: A convexity measurement for polygons. IEEE Trans. Pattern Anal. Mach. Intell. 26, 173–182 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Efrat, A., Hu, Y., Kobourov, S.G., Pupyrev, S. (2014). MapSets: Visualizing Embedded and Clustered Graphs. In: Duncan, C., Symvonis, A. (eds) Graph Drawing. GD 2014. Lecture Notes in Computer Science, vol 8871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45803-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-662-45803-7_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45802-0
Online ISBN: 978-3-662-45803-7
eBook Packages: Computer ScienceComputer Science (R0)