{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T08:39:13Z","timestamp":1794559153899,"version":"4.9.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_38","type":"book-chapter","created":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T22:42:19Z","timestamp":1516401739000},"page":"492-505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Painter\u2019s Problem: Covering a Grid with Colored Connected Polygons"],"prefix":"10.1007","author":[{"given":"Arthur","family":"van Goethem","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Irina","family":"Kostitsyna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wouter","family":"Meulemans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Max","family":"Sondag","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jules","family":"Wulms","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-50106-2_7","volume-title":"Graph Drawing and Network Visualization","author":"HA Akitaya","year":"2016","unstructured":"Akitaya, H.A., L\u00f6ffler, M., T\u00f3th, C.D.: Multi-colored spanning graphs. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 81\u201393. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_7"},{"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., Czerwinski, M.: Design study of LineSets, a novel set visualization technique. IEEE Trans. Vis. Comput. Graph. 17(12), 2259\u20132267 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"12","key":"38_CR3","doi-asserted-by":"publisher","first-page":"2496","DOI":"10.1109\/TVCG.2013.184","volume":"19","author":"B Alsallakh","year":"2013","unstructured":"Alsallakh, B., Aigner, W., Miksch, S., Hauser, H.: Radial sets: interactive visual analysis of large overlapping sets. IEEE Trans. Vis. Comput. Graph. 19(12), 2496\u20132505 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"38_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1111\/cgf.12722","volume":"35","author":"B Alsallakh","year":"2016","unstructured":"Alsallakh, B., Micallef, L., Aigner, W., Hauser, H., Miksch, S., Rodgers, P.: The state of the art of set visualization. Comput. Graph. Forum 35(1), 234\u2013260 (2016)","journal-title":"Comput. Graph. Forum"},{"issue":"384","key":"38_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.2307\/3614533","volume":"53","author":"M Baron","year":"1969","unstructured":"Baron, M.: A note on the historical development of logic diagrams: Leibniz, Euler and Venn. Math. Gaz. 53(384), 113\u2013125 (1969)","journal-title":"Math. Gaz."},{"issue":"4","key":"38_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.7155\/jgaa.00237","volume":"15","author":"K Buchin","year":"2011","unstructured":"Buchin, K., van Kreveld, M., Meijer, H., Speckmann, B., Verbeek, K.: On planar supports for hypergraphs. J. Graph Algorithms Appl. 15(4), 533\u2013549 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"6","key":"38_CR7","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. Graph. 15(6), 1009\u20131016 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3pt1","key":"38_CR8","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.: Kelp diagrams: point set membership visualization. Comput. Graph. Forum 31(3pt1), 875\u2013884 (2012)","journal-title":"Comput. Graph. Forum"},{"issue":"1","key":"38_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0196-6774(92)90004-V","volume":"13","author":"D Eppstein","year":"1992","unstructured":"Eppstein, D., Italiano, G., Tamassia, R., Tarjan, R., Westbrook, J., Yung, M.: Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms 13(1), 33\u201354 (1992)","journal-title":"J. Algorithms"},{"issue":"6","key":"38_CR10","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/TVCG.2010.210","volume":"16","author":"NH Riche","year":"2010","unstructured":"Riche, N.H., Dwyer, T.: Untangling Euler diagrams. IEEE Trans. Vis. Comput. Graph. 16(6), 1090\u20131099 (2010)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"38_CR11","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. 8242, pp. 280\u2013291. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_25"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-642-00219-9_39","volume-title":"Graph Drawing","author":"M Kaufmann","year":"2009","unstructured":"Kaufmann, M., van Kreveld, M., Speckmann, B.: Subdivision drawings of hypergraphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 396\u2013407. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_39"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1080\/00207169008803875","volume":"34","author":"E M\u00e4kinen","year":"1990","unstructured":"M\u00e4kinen, E.: How to draw a hypergraph. Int. J. Comput. Math. 34, 177\u2013185 (1990)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"38_CR14","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/TVCG.2016.2598542","volume":"23","author":"W Meulemans","year":"2017","unstructured":"Meulemans, W., Dykes, J., Slingsby, A., Turkay, C., Wood, J.: Small multiples with gaps. IEEE Trans. Vis. Comput. Graph. 23(1), 381\u2013390 (2017)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"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.H., Speckmann, B., Alper, B., Dwyer, T., Dwyer, T.: KelpFusion: a hybrid set visualization technique. IEEE Trans. Vis. Comput. Graph. 19(11), 1846\u20131858 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"5","key":"38_CR16","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1006\/jvlc.2002.0232","volume":"13","author":"H Purchase","year":"2002","unstructured":"Purchase, H.: Metrics for graph drawing aesthetics. J. Vis. Lang. Comput. 13(5), 501\u2013516 (2002)","journal-title":"J. Vis. Lang. Comput."},{"key":"38_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0021827","volume-title":"Graph Drawing","author":"HC Purchase","year":"1996","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating graph drawing aesthetics. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 435\u2013446. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021827"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Simonetto, P., Auber, D.: Visualise undrawable Euler diagrams. In: Proceedings of the 12th Conference on Information Visualisation, pp. 594\u2013599 (2008)","DOI":"10.1109\/IV.2008.78"},{"issue":"3","key":"38_CR19","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 28(3), 967\u2013974 (2009)","journal-title":"Comput. Graph. Forum"},{"key":"38_CR20","volume-title":"Graph Theory","author":"W Tutte","year":"1984","unstructured":"Tutte, W.: Graph Theory. Addison-Wesley, Menlo Park (1984)"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"van Goethem, A., Kostitsyna, I., van Kreveld, M., Meulemans, W., Sondag, M., Wulms, J.: The painter\u2019s problem: covering a grid with colored connected polygons. Computing Research Repository, arXiv:1709.00001 (2017)","DOI":"10.1007\/978-3-319-73915-1_38"},{"key":"38_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0095-8956(75)90042-8","volume":"18","author":"T Walsh","year":"1975","unstructured":"Walsh, T.: Hypermaps versus bipartite maps. J. Comb. Theor. 18, 155\u2013163 (1975)","journal-title":"J. Comb. Theor."},{"issue":"6","key":"38_CR23","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TVCG.2008.165","volume":"14","author":"J Wood","year":"2008","unstructured":"Wood, J., Dykes, J.: Spatially ordered treemaps. IEEE Trans. Vis. Comput. Graph. 14(6), 1348\u20131355 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73915-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T07:25:36Z","timestamp":1710228336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_38","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}