{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:36:18Z","timestamp":1766378178290,"version":"3.48.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030929305"},{"type":"electronic","value":"9783030929312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_24","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"329-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Arrangements of\u00a0Orthogonal Circles with\u00a0Many Intersections"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3124-2016","authenticated-orcid":false,"given":"Sarah","family":"Carmesin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2134-4852","authenticated-orcid":false,"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"issue":"4","key":"24_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00454-001-0043-x","volume":"26","author":"N Alon","year":"2001","unstructured":"Alon, N., Last, H., Pinchasi, R., Sharir, M.: On the complexity of arrangements of circles in the plane. Discrete Comput. Geom. 26(4), 465\u2013492 (2001). https:\/\/doi.org\/10.1007\/s00454-001-0043-x","journal-title":"Discrete Comput. Geom."},{"key":"24_CR2","doi-asserted-by":"publisher","unstructured":"Andreev, E.M.: Convex polyhedra in Loba\u010devski\u012d spaces. Mat. Sb. (N.S.) 81(123)(3), 445\u2013478 (1970). https:\/\/doi.org\/10.1070\/SM1970v010n03ABEH001677","DOI":"10.1070\/SM1970v010n03ABEH001677"},{"issue":"1\u20132","key":"24_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9(1\u20132), 3\u201324 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(97)00014-X","journal-title":"Comput. Geom."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Carmesin, S., Schulz, A.: Arrangements of orthogonal circles with many intersections (2021). https:\/\/arxiv.org\/abs\/2106.03557v2","DOI":"10.1007\/978-3-030-92931-2_24"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-030-35802-0_17","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2019","unstructured":"Chaplick, S., F\u00f6rster, H., Kryven, M., Wolff, A.: On arrangements of orthogonal circles. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 216\u2013229. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_17"},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Chaplick, S., F\u00f6rster, H., Kryven, M., Wolff, A.: Drawing graphs with circular arcs and right-angle crossings. In: Albers, S. (ed.) 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 162, pp. 21:1\u201321:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2020.21","DOI":"10.4230\/LIPIcs.SWAT.2020.21"},{"issue":"39","key":"24_CR7","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theor. Comput. Sci. 412(39), 5156\u20135166 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.025","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.7155\/jgaa.00251","volume":"16","author":"CA Duncan","year":"2012","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi drawings of graphs. J. Graph Algorithms Appl. 16(1), 85\u2013108 (2012). https:\/\/doi.org\/10.7155\/jgaa.00251","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s00454-014-9627-0","volume":"52","author":"D Eppstein","year":"2014","unstructured":"Eppstein, D.: A M\u00f6bius-invariant power diagram and its applications to soap bubbles and planar lombardi drawing. Discrete Comput. Geom. 52(3), 515\u2013550 (2014). https:\/\/doi.org\/10.1007\/s00454-014-9627-0","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/s00454-019-00077-y","volume":"64","author":"S Felsner","year":"2019","unstructured":"Felsner, S., Scheucher, M.: Arrangements of pseudocircles: on circularizability. Discrete Comput. Geom. 64(3), 776\u2013813 (2019). https:\/\/doi.org\/10.1007\/s00454-019-00077-y","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20133","key":"24_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P Hlinen\u00fd","year":"2001","unstructured":"Hlinen\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."},{"key":"24_CR12","doi-asserted-by":"publisher","unstructured":"Huang, W., Hong, S., Eades, P.: Effects of crossing angles. In: IEEE VGTC Pacific Visualization Symposium 2008, PacificVis 2008, Kyoto, Japan, 5\u20137, March 2008, pp. 41\u201346. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/PACIFICVIS.2008.4475457","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"issue":"4","key":"24_CR13","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1007\/s00454-014-9583-8","volume":"51","author":"RJ Kang","year":"2014","unstructured":"Kang, R.J., M\u00fcller, T.: Arrangements of pseudocircles and circles. Discrete Comput. Geom. 51(4), 896\u2013925 (2014). https:\/\/doi.org\/10.1007\/s00454-014-9583-8","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"24_CR14","first-page":"444","volume":"10","author":"P Kindermann","year":"2019","unstructured":"Kindermann, P., Kobourov, S.G., L\u00f6ffler, M., N\u00f6llenburg, M., Schulz, A., Vogtenhuber, B.: Lombardi drawings of knots and links. J. Comput. Geom. 10(1), 444\u2013476 (2019)","journal-title":"J. Comput. Geom."},{"key":"24_CR15","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)"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.ejc.2013.06.037","volume":"35","author":"C McDiarmid","year":"2014","unstructured":"McDiarmid, C., M\u00fcller, T.: The number of disk graphs. Eur. J. Comb. 35, 413\u2013431 (2014). https:\/\/doi.org\/10.1016\/j.ejc.2013.06.037","journal-title":"Eur. J. Comb."}],"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-92931-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:54Z","timestamp":1766365314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 2021","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","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":"74","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":"23","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":"5","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":"31% - 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.02","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":"8.6","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"}]}}