{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:26:31Z","timestamp":1760441191378},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_25","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"280-291","source":"Crossref","is-referenced-by-count":6,"title":["Colored Spanning Graphs for Set Visualization"],"prefix":"10.1007","author":[{"given":"Ferran","family":"Hurtado","sequence":"first","affiliation":[]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"given":"Vera","family":"Sacrist\u00e1n","sequence":"additional","affiliation":[]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-44676-1_23","volume-title":"Algorithms - ESA 2001","author":"M. Abellanas","year":"2001","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacrist\u00e1n, V.: Smallest color-spanning objects. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 278\u2013289. Springer, Heidelberg (2001)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45749-6_6","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.M.: Range searching in categorical data: Colored range searching on grid. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 17\u201328. Springer, Heidelberg (2002)"},{"issue":"12","key":"25_CR3","first-page":"2259","volume":"17","author":"B. Alper","year":"2011","unstructured":"Alper, B., Riche, N., Ramos, G., Czerwinski, M.: Design study of LineSets, a novel set visualization technique. IEEE TVCG\u00a017(12), 2259\u20132267 (2011)","journal-title":"IEEE TVCG"},{"issue":"5","key":"25_CR4","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.jda.2011.12.009","volume":"14","author":"U. Brandes","year":"2012","unstructured":"Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Path-based supports for hypergraphs. J. Discrete Algorithms\u00a014, 248\u2013261 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"25_CR6","volume-title":"Research Problems in Discrete Geometry","author":"P. Brass","year":"2005","unstructured":"Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.jvlc.2008.09.001","volume":"20","author":"H. Byelas","year":"2009","unstructured":"Byelas, H., Telea, A.: Towards realism in drawing areas of interest on architecture diagrams. Visual Languages and Computing\u00a020(2), 110\u2013128 (2009)","journal-title":"Visual Languages and Computing"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1111\/j.1749-6632.1985.tb14564.x","volume":"440","author":"F. Chung","year":"1986","unstructured":"Chung, F., Graham, R.: A new bound for Euclidean Steiner minimum trees. Ann. N.Y. Acad. Sci.\u00a0440, 328\u2013346 (1986)","journal-title":"Ann. N.Y. Acad. Sci."},{"issue":"6","key":"25_CR9","first-page":"1009","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 TVCG\u00a015(6), 1009\u20131016 (2009)","journal-title":"IEEE TVCG"},{"issue":"3","key":"25_CR10","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., Speckmann, B., Westenberg, M.A.: Kelp Diagrams: Point set membership visualization. Computer Graphics Forum\u00a031(3), 875\u2013884 (2012)","journal-title":"Computer Graphics Forum"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Edwards, A.W.F.: Cogwheels of the mind. John Hopkins University Press (2004)","DOI":"10.56021\/9780801874345"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E. Gilbert","year":"1968","unstructured":"Gilbert, E., Pollak, H.: Steiner minimal trees. SIAM J. Appl. Math.\u00a016, 1\u201329 (1968)","journal-title":"SIAM J. Appl. Math."},{"issue":"6","key":"25_CR13","first-page":"1090","volume":"16","author":"N. Henry Riche","year":"2010","unstructured":"Henry Riche, N., Dwyer, T.: Untangling Euler diagrams. IEEE TVCG\u00a016(6), 1090\u20131099 (2010)","journal-title":"IEEE TVCG"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane \u2013 a survey. In: Discrete and Comp. Geometry, The Goodman-Pollack Festschrift, pp. 551\u2013570 (2003)","DOI":"10.1007\/978-3-642-55566-4_25"},{"key":"25_CR15","unstructured":"Meulemans, W., Henry Riche, N., Speckmann, B., Alper, B., Dwyer, T.: KelpFusion: a hybrid set visualization technique. In: IEEE TVCG (to appear, 2013)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Handbook of Computational Geometry, pp. 633\u2013701 (1998)","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"issue":"4","key":"25_CR17","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"J.S.B. Mitchell","year":"1999","unstructured":"Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput.\u00a028(4), 1298\u20131309 (1999)","journal-title":"SIAM J. Comput."},{"issue":"3-4","key":"25_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0925-7721(00)00021-3","volume":"17","author":"D.M. Mount","year":"2000","unstructured":"Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: Chromatic nearest neighbor searching: A query sensitive approach. Computational Geometry: Theory and Applications\u00a017(3-4), 97\u2013119 (2000)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"25_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Simonetto, P., Auber, D.: Visualise undrawable Euler diagrams. In: Proc. 12th Conf. on Information Visualisation, pp. 594\u2013599 (2008)","DOI":"10.1109\/IV.2008.78"},{"issue":"1","key":"25_CR21","first-page":"88","volume":"17","author":"G. Stapleton","year":"2011","unstructured":"Stapleton, G., Rodgers, P., Howse, J., Zhang, L.: Inductively generating Euler diagrams. IEEE TVCG\u00a017(1), 88\u2013100 (2011)","journal-title":"IEEE TVCG"},{"issue":"6","key":"25_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0020-0190(96)00124-X","volume":"59","author":"S. Tokunaga","year":"1996","unstructured":"Tokunaga, S.: Intersection number of two connected geometric graphs. Information Processing Letters\u00a059(6), 331\u2013333 (1996)","journal-title":"Information Processing Letters"},{"key":"25_CR23","unstructured":"Tufte, E.R.: The Visual Display of Quantitative Information. Graphics Press (1983)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T11:42:18Z","timestamp":1688816538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}