{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T05:35:52Z","timestamp":1769578552861,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030044138","type":"print"},{"value":"9783030044145","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-030-04414-5_4","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T13:20:45Z","timestamp":1545052845000},"page":"53-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Short Plane Supports for Spatial Hypergraphs"],"prefix":"10.1007","author":[{"given":"Thom","family":"Castermans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mereke","family":"van Garderen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wouter","family":"Meulemans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoru","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"key":"4_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":"4_CR2","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1109\/TVCG.2011.186","volume":"17","author":"B Alper","year":"2011","unstructured":"Alper, B., Henry Riche, N., Ramos, G., Czerwinski, M.: Design study of LineSets, a novel set visualization technique. IEEE Trans. Vis. Comput. Graph. 17(12), 2259\u20132267 (2011). https:\/\/doi.org\/10.1109\/TVCG.2011.186","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"4_CR3","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). https:\/\/doi.org\/10.1111\/cgf.12722","journal-title":"Comput. Graph. Forum"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-662-48971-0_37","volume-title":"Algorithms and Computation","author":"S Bereg","year":"2015","unstructured":"Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., Wolff, A.: Colored non-crossing euclidean steiner forest. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 429\u2013441. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_37"},{"issue":"23","key":"4_CR5","doi-asserted-by":"publisher","first-page":"2459","DOI":"10.1016\/j.tcs.2010.10.038","volume":"412","author":"S Bereg","year":"2011","unstructured":"Bereg, S., Jiang, M., Yang, B., Zhu, B.: On the red\/blue spanning tree problem. Theor. Comput. Sci. 412(23), 2459\u20132467 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.10.038","journal-title":"Theor. Comput. Sci."},{"key":"4_CR6","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 14, 248\u2013261 (2012). https:\/\/doi.org\/10.1016\/j.jda.2011.12.009","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"4_CR7","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). https:\/\/doi.org\/10.7155\/jgaa.00237","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Castermans, T., van Garderen, M., Meulemans, W., N\u00f6llenburg, M., Yuan, X.: Short plane supports for spatial hypergraphs. Computing Research Repository, arXiv:1808.09729 (2018)","DOI":"10.1007\/978-3-030-04414-5_4"},{"issue":"6","key":"4_CR9","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). https:\/\/doi.org\/10.1109\/TVCG.2009.122","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3pt1","key":"4_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.: Kelp diagrams: point set membership visualization. Comput. Graph. Forum 31(3pt1), 875\u2013884 (2012). https:\/\/doi.org\/10.1111\/j.1467-8659.2012.03080.x","journal-title":"Comput. Graph. Forum"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"571","DOI":"10.7155\/jgaa.00364","volume":"19","author":"A Efrat","year":"2015","unstructured":"Efrat, A., Hu, Y., Kobourov, S.G., Pupyrev, S.: MapSets: visualizing embedded and clustered graphs. J. Graph Algorithms Appl. 19(2), 571\u2013593 (2015). https:\/\/doi.org\/10.7155\/jgaa.00364","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-319-73915-1_38","volume-title":"Graph Drawing and Network Visualization","author":"A van Goethem","year":"2018","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. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 492\u2013505. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_38"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.comgeo.2017.06.006","volume":"68","author":"F Hurtado","year":"2018","unstructured":"Hurtado, F., et al.: Colored spanning graphs for set visualization. Comput. Geom.: Theory Appl. 68, 262\u2013276 (2018). https:\/\/doi.org\/10.1016\/j.comgeo.2017.06.006","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190110306","volume":"11","author":"DS Johnson","year":"1987","unstructured":"Johnson, D.S., Pollak, H.O.: Hypergraph planarity and the complexity of drawing Venn diagrams. J. Graph Theory 11(3), 309\u2013325 (1987). https:\/\/doi.org\/10.1002\/jgt.3190110306","journal-title":"J. Graph Theory"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-08404-6_23","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"B Klemz","year":"2014","unstructured":"Klemz, B., Mchedlidze, T., N\u00f6llenburg, M.: Minimum tree supports for hypergraphs and low-concurrency euler diagrams. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 265\u2013276. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_23"},{"issue":"1\u20133","key":"4_CR16","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10107-003-0410-x","volume":"98","author":"E Korach","year":"2003","unstructured":"Korach, E., Stern, M.: The clustering matroid and the optimal clustering tree. Math. Program. 98(1\u20133), 385\u2013414 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0410-x","journal-title":"Math. Program."},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982). https:\/\/doi.org\/10.1137\/0211025","journal-title":"SIAM J. Comput."},{"issue":"11","key":"4_CR18","doi-asserted-by":"publisher","first-page":"1846","DOI":"10.1109\/TVCG.2013.76","volume":"19","author":"W Meulemans","year":"2013","unstructured":"Meulemans, W., Henry Riche, N., Speckmann, B., Alper, B., Dwyer, T.: KelpFusion: a hybrid set visualization technique. IEEE Trans. Vis. Comput. Graph. 19(11), 1846\u20131858 (2013). https:\/\/doi.org\/10.1109\/TVCG.2013.76","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"5","key":"4_CR19","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). https:\/\/doi.org\/10.1006\/jvlc.2002.0232","journal-title":"J. Vis. Lang. Comput."},{"key":"4_CR20","volume-title":"The Visual Display of Quantitative Information","author":"E Tufte","year":"2001","unstructured":"Tufte, E.: The Visual Display of Quantitative Information. Graphics Press, Cheshire (2001)"}],"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-030-04414-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:52:51Z","timestamp":1710233571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 December 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":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dccg.upc.edu\/gd2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.92","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The book also contains 1 full invited paper and 1 contest report","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}