{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:13:27Z","timestamp":1778498007574,"version":"3.51.4"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030358013","type":"print"},{"value":"9783030358020","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_2","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Representing Graphs and Hypergraphs by Touching Polygons in 3D"],"prefix":"10.1007","author":[{"given":"William","family":"Evans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noushin","family":"Saeedi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3073-6863","authenticated-orcid":false,"given":"Chan-Su","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Alam, M.J.: Contact representations of graphs in 2D and 3D. Ph.D. thesis, The University of Arizona (2015)","DOI":"10.1109\/IISA.2014.6878773"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-319-21840-3_2","volume-title":"Algorithms and Data Structures","author":"J Alam","year":"2015","unstructured":"Alam, J., Evans, W., Kobourov, S., Pupyrev, S., Toeniskoetter, J., Ueckerdt, T.: Contact representations of graphs in 3D. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 14\u201327. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21840-3_2"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-662-49192-8_9","volume-title":"SOFSEM 2016: Theory and Practice of Computer Science","author":"MJ Alam","year":"2016","unstructured":"Alam, M.J., Kaufmann, M., Kobourov, S.G.: On contact graphs with cubes and proportional boxes. In: Freivalds, R.M., Engels, G., Catania, B. (eds.) SOFSEM 2016. LNCS, vol. 9587, pp. 107\u2013120. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49192-8_9"},{"key":"2_CR4","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. Discret. Algorithms 14, 248\u2013261 (2012). https:\/\/doi.org\/10.1016\/j.jda.2011.12.009","journal-title":"J. Discret. Algorithms"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Bremner, D., Evans, W., Frati, F., Heyer, L., Kobourov, S.G., Lenhart, W.J., Liotta, G., Rappaport, D., Whitesides, S.H.: On representing graphs by touching cuboids. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 187\u2013198. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_17","DOI":"10.1007\/978-3-642-36763-2_17"},{"issue":"4","key":"2_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.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."},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 460\u2013467 (1988). https:\/\/doi.org\/10.1145\/62212.62257","DOI":"10.1145\/62212.62257"},{"key":"2_CR8","unstructured":"Carmesin, J.: Embedding simply connected 2-complexes in 3-space - I. A Kuratowski-type characterisation. ArXiv report (2019). http:\/\/arxiv.org\/abs\/1709.04642"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02574381","volume":"12","author":"TK Dey","year":"1994","unstructured":"Dey, T.K., Edelsbrunner, H.: Counting triangle crossings and halving planes. Discrete Comput. Geom. 12(3), 281\u2013289 (1994). https:\/\/doi.org\/10.1007\/BF02574381","journal-title":"Discrete Comput. Geom."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-11266-9_27","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"K Diks","year":"2010","unstructured":"Diks, K., Sta\u0144czyk, P.: Perfect matching for biconnected cubic graphs in $${O}(n \\log ^2 n)$$ time. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 321\u2013333. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11266-9_27"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Erickson, J., Kim, S.: Arbitrarily large neighborly families of congruent symmetric convex 3-polytopes. In: Bezdek, A. (ed.) Discrete Geometry, Pure and Applied Mathematics, vol. 253, pp. 267\u2013278. Marcel Dekker, New York (2003). In Honor of W. Kuperberg\u2019s 60th Birthday","DOI":"10.1201\/9780203911211.ch19"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Evans, W., Rz\u0105\u017cewski, P., Saeedi, N., Shin, C.S., Wolff, A.: Representing graphs and hypergraphs by touching polygons in 3D. ArXiv report (2019). http:\/\/arxiv.org\/abs\/1908.08273","DOI":"10.1007\/978-3-030-35802-0_2"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Felsner, S., Francis, M.C.: Contact representations of planar graphs with cubes. In: Hurtado, F., van Kreveld, M.J. (eds.) Proceedings of the 27th Annual Symposium on Computational Geometry (SoCG 2011), pp. 315\u2013320. ACM (2011). https:\/\/doi.org\/10.1145\/1998196.1998250","DOI":"10.1145\/1998196.1998250"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0021810","volume-title":"Graph Drawing","author":"H Gropp","year":"1996","unstructured":"Gropp, H.: The drawing of configurations. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 267\u2013276. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0021810"},{"issue":"1\u20133","key":"2_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P Hlin\u011bn\u00fd","year":"2001","unstructured":"Hlin\u011bn\u00fd, P., Kratochv\u00edl, J.: Representing graphs by disks and balls (a survey of recognition-complexity results). Discret. Math. 229(1\u20133), 101\u2013124 (2001). https:\/\/doi.org\/10.1016\/S0012-365X(00)00204-1","journal-title":"Discret. Math."},{"issue":"3","key":"2_CR16","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":"2_CR17","doi-asserted-by":"publisher","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akad. der Wissen. zu Leipzig. Math.-Phys. Klasse 88, 141\u2013164 (1936). https:\/\/doi.org\/10.1007\/BF02418546","DOI":"10.1007\/BF02418546"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory Ser. B 62(2), 289\u2013315 (1994). https:\/\/doi.org\/10.1006\/jctb.1994.1071","journal-title":"J. Comb. Theory Ser. B"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-18469-7_35","volume-title":"Graph Drawing","author":"EJ van Leeuwen","year":"2011","unstructured":"van Leeuwen, E.J., van Leeuwen, J.: Convex polygon intersection graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 377\u2013388. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_35"},{"key":"2_CR20","unstructured":"Matou\u0161ek, J.: Intersection graphs of segments and $$\\exists \\mathbb{R}$$. ArXiv report (2014). http:\/\/arxiv.org\/abs\/1406.2636"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.7155\/jgaa.00048","volume":"6","author":"PO de Mendez","year":"2002","unstructured":"de Mendez, P.O.: Realization of posets. J. Graph Algorithms Appl. 6(1), 149\u2013153 (2002). https:\/\/doi.org\/10.7155\/jgaa.00048","journal-title":"J. Graph Algorithms Appl."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Petersen","year":"1891","unstructured":"Petersen, J.: Die Theorie der regul\u00e4ren graphs. Acta Math. 15, 193\u2013220 (1891). https:\/\/doi.org\/10.1007\/BF02392606","journal-title":"Acta Math."},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-11805-0_32","volume-title":"Graph Drawing","author":"M Schaefer","year":"2010","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 334\u2013344. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32"},{"key":"2_CR24","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990). https:\/\/dl.acm.org\/citation.cfm?id=320176.320191"},{"issue":"1","key":"2_CR25","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(86)90061-4","volume":"40","author":"C Thomassen","year":"1986","unstructured":"Thomassen, C.: Interval representations of planar graphs. J. Comb. Theory Ser. B 40(1), 9\u201320 (1986). https:\/\/doi.org\/10.1016\/0095-8956(86)90061-4","journal-title":"J. Comb. Theory Ser. B"},{"key":"2_CR26","unstructured":"Weisstein, E.W.: Steiner quadruple system. From MathWorld \u2013 A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/SteinerQuadrupleSystem.html. Accessed 20 Aug 2019"},{"key":"2_CR27","unstructured":"Weisstein, E.W.: Steiner triple system. From MathWorld \u2013 A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/SteinerTripleSystem.html. Accessed 20 Aug 2019"},{"issue":"1","key":"2_CR28","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF01758773","volume":"7","author":"J Westbrook","year":"1992","unstructured":"Westbrook, J., Tarjan, R.E.: Maintaining bridge-connected and biconnected components on-line. Algorithmica 7(1), 433\u2013464 (1992). https:\/\/doi.org\/10.1007\/BF01758773","journal-title":"Algorithmica"},{"issue":"6","key":"2_CR29","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1070\/RM1974v029n06ABEH001303","volume":"29","author":"AA Zykov","year":"1974","unstructured":"Zykov, A.A.: Hypergraphs. Uspekhi Mat. Nauk 29(6), 89\u2013154 (1974). https:\/\/doi.org\/10.1070\/RM1974v029n06ABEH001303","journal-title":"Uspekhi Mat. Nauk"}],"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-35802-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:02:31Z","timestamp":1701133351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}