{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:57:42Z","timestamp":1775080662123,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319125671","type":"print"},{"value":"9783319125688","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_38","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:12:53Z","timestamp":1417432373000},"page":"452-463","source":"Crossref","is-referenced-by-count":8,"title":["MapSets: Visualizing Embedded and Clustered Graphs"],"prefix":"10.1007","author":[{"given":"Alon","family":"Efrat","sequence":"first","affiliation":[]},{"given":"Yifan","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"38_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02574698","volume":"6","author":"P.K. Agarwal","year":"1991","unstructured":"Agarwal, P.K., Edelsbrunner, H., Schwarzkopf, O., Welzl, E.: Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Comput. Geom.\u00a06(1), 407\u2013422 (1991)","journal-title":"Discrete & Comput. Geom."},{"issue":"12","key":"38_CR2","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1109\/TVCG.2011.186","volume":"17","author":"B. Alper","year":"2011","unstructured":"Alper, B., Riche, N.H., Ramos, G., Czerwinski, M.: Design study of LineSets, a novel set visualization technique. IEEE Trans. Vis. Comput. Graphics\u00a017(12), 2259\u20132267 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"3","key":"38_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00453-004-1103-4","volume":"40","author":"S. Arora","year":"2004","unstructured":"Arora, S., Chang, K.: Approximation schemes for degree-restricted MST and red\u2013blue separation problems. Algorithmica\u00a040(3), 189\u2013210 (2004)","journal-title":"Algorithmica"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s11192-005-0255-6","volume":"64","author":"K.W. Boyack","year":"2005","unstructured":"Boyack, K.W., Klavans, R., B\u00f6rner, K.: Mapping the backbone of science. Scientometrics\u00a064, 351\u2013374 (2005)","journal-title":"Scientometrics"},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1111\/j.1749-6632.1985.tb14564.x","volume":"440","author":"F. Chung","year":"1985","unstructured":"Chung, F., Graham, R.: A new bound for Euclidean Steiner minimal trees. Annals of the New York Academy of Sciences\u00a0440(1), 328\u2013346 (1985)","journal-title":"Annals of the New York Academy of Sciences"},{"issue":"6","key":"38_CR6","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1109\/TVCG.2009.122","volume":"15","author":"C. Collins","year":"2009","unstructured":"Collins, C., Penn, G., Carpendale, S.: Bubble sets: Revealing set relations with isocontours over existing visualizations. IEEE Trans. Vis. Comput. Graphics\u00a015(6), 1009\u20131016 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"3, pt1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1111\/j.1467-8659.2012.03080.x","volume":"31","author":"K. Dinkla","year":"2012","unstructured":"Dinkla, K., van Kreveld, M.J., Speckmann, B., Westenberg, M.A.: Kelp diagrams: Point set membership visualization. Comput. Graph. Forum\u00a031(3, pt1), 875\u2013884 (2012)","journal-title":"Comput. Graph. Forum"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-11805-0_15","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2010","unstructured":"Dwyer, T., Nachmanson, L.: Fast edge-routing for large graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 147\u2013158. Springer, Heidelberg (2010)"},{"issue":"6","key":"38_CR9","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/MCG.2010.101","volume":"30","author":"Y. Hu","year":"2010","unstructured":"Hu, Y., Gansner, E.R., Kobourov, S.G.: Visualizing graphs and clusters as maps. IEEE Comput. Graphics and Appl.\u00a030(6), 54\u201366 (2010)","journal-title":"IEEE Comput. Graphics and Appl."},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-03841-4_25","volume-title":"Graph Drawing","author":"F. Hurtado","year":"2013","unstructured":"Hurtado, F., Korman, M., van Kreveld, M., L\u00f6ffler, M., Sacrist\u00e1n, V., Silveira, R.I., Speckmann, B.: Colored spanning graphs for set visualization. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 280\u2013291. Springer, Heidelberg (2013)"},{"issue":"11","key":"38_CR11","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.1109\/TVCG.2014.2315995","volume":"20","author":"R. Jianu","year":"2014","unstructured":"Jianu, R., Rusu, A., Hu, Y., Taggart, D.: How to display group information on node-link diagrams: An evaluation. IEEE Trans. Vis. Comput. Graphics\u00a020(11), 1530\u20131541 (2014)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"38_CR12","unstructured":"Kanizsa, G., Gerbino, W.: Convexity and symmetry in figure-ground organization. Vision and Artifact, 25\u201332 (1976)"},{"key":"38_CR13","unstructured":"Kobourov, S.G., Pupyrev, S., Simonetto, P.: Visualizing graphs as maps with contiguous regions. Comput. Graph. Forum (2014)"},{"issue":"1","key":"38_CR14","first-page":"85","volume":"31","author":"J. Kratochv\u00edl","year":"1990","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J.: Independent set and clique problems in intersection-defined classes of graphs. Commentationes Math. Univ. Carolinae\u00a031(1), 85\u201393 (1990)","journal-title":"Commentationes Math. Univ. Carolinae"},{"issue":"11","key":"38_CR15","doi-asserted-by":"publisher","first-page":"1846","DOI":"10.1109\/TVCG.2013.76","volume":"19","author":"W. Meulemans","year":"2013","unstructured":"Meulemans, W., Riche, N., Speckmann, B., Alper, B., Dwyer, T.: KelpFusion: A hybrid set visualization technique. IEEE Trans. Vis. Comput. Graphics\u00a019(11), 1846\u20131858 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"38_CR16","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume":"334","author":"J.S. Mitchell","year":"2000","unstructured":"Mitchell, J.S.: Geometric shortest paths and network optimization. Handbook of Computational Geometry\u00a0334, 633\u2013702 (2000)","journal-title":"Handbook of Computational Geometry"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Novembre, et al.: Genes mirror geography within Europe. Nature 456(7218), 98\u2013101 (2008)","DOI":"10.1038\/nature07331"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","first-page":"136","volume-title":"GD 2011","author":"S. Pupyrev","year":"2011","unstructured":"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.\u00a07034, pp. 136\u2013147. Springer, Heidelberg (2011)"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Purves, D., Lotto, R.B.: Why we see what we do: An empirical theory of vision. Sinauer Associates (2003)","DOI":"10.1511\/2002.9.236"},{"issue":"6","key":"38_CR20","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/TVCG.2010.210","volume":"16","author":"N.H. Riche","year":"2010","unstructured":"Riche, N.H., Dwyer, T.: Untangling Euler diagrams. IEEE Trans. Vis. Comput. Graphics\u00a016(6), 1090\u20131099 (2010)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"issue":"3","key":"38_CR21","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1111\/j.1467-8659.2009.01452.x","volume":"28","author":"P. Simonetto","year":"2009","unstructured":"Simonetto, P., Auber, D., Archambault, D.: Fully automatic visualisation of overlapping sets. Comput. Graph. Forum\u00a028(3), 967\u2013974 (2009)","journal-title":"Comput. Graph. Forum"},{"key":"38_CR22","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1559\/152304003100011081","volume":"30","author":"A. Skupin","year":"2003","unstructured":"Skupin, A., Fabrikant, S.I.: Spatialization methods: a cartographic research agenda for non-geographic information visualization. Cartogr. Geogr. Inform.\u00a030, 95\u2013119 (2003)","journal-title":"Cartogr. Geogr. Inform."},{"key":"38_CR23","unstructured":"Sonka, M., Hlavac, V., Boyle, R.: Image Processing, Analysis, and Machine Vision. Thomson-Engineering (2007)"},{"key":"38_CR24","first-page":"173","volume":"26","author":"J. Zunic","year":"2002","unstructured":"Zunic, J., Rosin, P.L.: A convexity measurement for polygons. IEEE Trans. Pattern Anal. Mach. Intell.\u00a026, 173\u2013182 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T10:11:43Z","timestamp":1690711903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}