{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:55Z","timestamp":1770994075383,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031826696","type":"print"},{"value":"9783031826702","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-82670-2_18","type":"book-chapter","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T04:40:08Z","timestamp":1738816808000},"page":"241-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Representing Hypergraphs by\u00a0Point-Line Incidences"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Dobler","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"issue":"12","key":"18_CR1","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.A., 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":"18_CR2","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.J.: 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":"18_CR3","doi-asserted-by":"publisher","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","DOI":"10.1016\/J.JDA.2011.12.009"},{"issue":"4","key":"18_CR4","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.J., 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."},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.7155\/jgaa.00499","volume":"23","author":"T Castermans","year":"2019","unstructured":"Castermans, T., van Garderen, M., Meulemans, W., N\u00f6llenburg, M., Yuan, X.: Short plane supports for spatial hypergraphs. J. Graph Algorithms Appl. 23(3), 463\u2013498 (2019). https:\/\/doi.org\/10.7155\/jgaa.00499","journal-title":"J. Graph Algorithms Appl."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Coxeter, H.S.M., Greitzer, S.L.: Geometry revisited, vol.\u00a019. Mathematical Association of America (1967)","DOI":"10.5948\/UPO9780883859346"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Dobler, A., Kobourov, S., Mondal, D., N\u00f6llenburg, M.: Representing hypergraphs by point-line incidences. CoRR (2024). arXiv:2411.13985","DOI":"10.1007\/978-3-031-82670-2_18"},{"key":"18_CR8","unstructured":"Flowers, G.: Embeddings of configurations. Ph.D. thesis, University of Victoria (2015)"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"Frank, F., et al.: Using the metro-map metaphor for drawing hypergraphs. In: Bures, T., Dondi, R., Gamper, J., Guerrini, G., Jurdzinski, T., Pahl, C., Sikora, F., Wong, P.W.H. (eds.) Proc. Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2021). LNCS, vol. 12607, pp. 361\u2013372. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-67731-2_26","DOI":"10.1007\/978-3-030-67731-2_26"},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s00453-006-0157-x","volume":"47","author":"H de Fraysseix","year":"2007","unstructured":"de Fraysseix, H., de Mendez, P.O.: Representations by contact and intersection of segments. Algorithmica 47(4), 453\u2013463 (2007)","journal-title":"Algorithmica"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"de\u00a0Fraysseix, H., de\u00a0Mendez, P.O., Rosenstiehl, P.: Representation of planar hypergraphs by contacts of triangles. In: Hong, S., Nishizeki, T., Quan, W. (eds.) Proceedings of the Graph Drawing (GD 2007). LNCS, vol.\u00a04875, pp. 125\u2013136. Springer (2007) https:\/\/doi.org\/10.1007\/978-3-540-77537-9_15","DOI":"10.1007\/978-3-540-77537-9_15"},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/J.EJC.2007.12.004","volume":"30","author":"D Gon\u00e7alves","year":"2009","unstructured":"Gon\u00e7alves, D.: A planar linear hypergraph whose edges cannot be represented as straight line segments. Eur. J. Comb. 30(1), 280\u2013282 (2009). https:\/\/doi.org\/10.1016\/J.EJC.2007.12.004","journal-title":"Eur. J. Comb."},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Gropp, H.: The drawing of configurations. In: Brandenburg, F. (ed.) Proceedings of the Graph Drawing (GD 1995). LNCS, vol.\u00a01027, pp. 267\u2013276. Springer (1995) https:\/\/doi.org\/10.1007\/BFB0021810","DOI":"10.1007\/BFB0021810"},{"issue":"1\u20133","key":"18_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0012-365X(96)00327-5","volume":"174","author":"H Gropp","year":"1997","unstructured":"Gropp, H.: Configurations and their realization. Discret. Math. 174(1\u20133), 137\u2013151 (1997). https:\/\/doi.org\/10.1016\/S0012-365X(96)00327-5","journal-title":"Discret. Math."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Configurations of Points and Lines. American Mathematical Society (2009)","DOI":"10.1090\/gsm\/103"},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1109\/TVCG.2020.3030475","volume":"27","author":"B Jacobsen","year":"2021","unstructured":"Jacobsen, B., Wallinger, M., Kobourov, S.G., N\u00f6llenburg, M.: Metrosets: visualizing sets as metro maps. IEEE Trans. Vis. Comput. Graph. 27(2), 1257\u20131267 (2021). https:\/\/doi.org\/10.1109\/TVCG.2020.3030475","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"18_CR17","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":"18_CR18","doi-asserted-by":"publisher","unstructured":"Kim, E., de\u00a0Mesmay, A., Miltzow, T.: Representing matroids over the reals is $$\\exists \\mathbb{R}$$-complete. CoRR arXiv:abs\/2301.03221 (2023). https:\/\/doi.org\/10.48550\/arXiv.2301.03221","DOI":"10.48550\/arXiv.2301.03221"},{"key":"18_CR19","unstructured":"Matousek, J.: Intersection graphs of segments and $$\\exists \\mathbb{R}$$. CoRR (2014). arXiv:1406.2636"},{"issue":"3\u20134","key":"18_CR20","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. Computer Math. 34(3\u20134), 177\u2013185 (1990). https:\/\/doi.org\/10.1080\/00207169008803875","journal-title":"Int. J. Computer Math."},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) Proceedings of the Graph Drawing (GD 2009). LNCS, vol.\u00a05849, pp. 334\u2013344. Springer (2009) https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32","DOI":"10.1007\/978-3-642-11805-0_32"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Stretchability of pseudolines is NP-hard. In: Gritzmann, P., Sturmfels, B. (eds.) Proc. Applied Geometry And Discrete Mathematics (DIMACS 1090). DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a04, pp. 531\u2013554. DIMACS\/AMS (1991) https:\/\/doi.org\/10.1090\/DIMACS\/004\/41","DOI":"10.1090\/DIMACS\/004\/41"},{"key":"18_CR23","unstructured":"Steinitz, E.: \u00dcber die Construction der Configurationen $$n_3$$. Ph.D. thesis, Breslau (1894)"},{"issue":"2","key":"18_CR24","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539792235487","volume":"23","author":"R Swaminathan","year":"1994","unstructured":"Swaminathan, R., Wagner, D.K.: On the consecutive-retrieval problem. SIAM J. Comput. 23(2), 398\u2013414 (1994). https:\/\/doi.org\/10.1137\/S0097539792235487","journal-title":"SIAM J. Comput."},{"issue":"6","key":"18_CR25","doi-asserted-by":"publisher","first-page":"2821","DOI":"10.1109\/TVCG.2021.3074615","volume":"27","author":"M Wallinger","year":"2021","unstructured":"Wallinger, M., Jacobsen, B., Kobourov, S.G., N\u00f6llenburg, M.: On the readability of abstract set visualizations. IEEE Trans. Vis. Comput. Graph. 27(6), 2821\u20132832 (2021). https:\/\/doi.org\/10.1109\/TVCG.2021.3074615","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82670-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:57:02Z","timestamp":1757134622000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82670-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826696","9783031826702"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82670-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}