{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:35:01Z","timestamp":1766378101496,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"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_17","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"216-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Arrangements of Orthogonal Circles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3501-4608","authenticated-orcid":false,"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[]},{"given":"Henry","family":"F\u00f6rster","sequence":"additional","affiliation":[]},{"given":"Myroslav","family":"Kryven","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-55566-4_1","volume-title":"Discrete and Computational Geometry: The Goodman-Pollack Festschrift","author":"PK Agarwal","year":"2003","unstructured":"Agarwal, P.K., Aronov, B., Sharir, M.: On the complexity of many faces in arrangements of pseudo-segments and circles. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry: The Goodman-Pollack Festschrift, pp. 1\u201324. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-642-55566-4_1"},{"issue":"4","key":"17_CR2","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. Discret. Comput. Geom. 26(4), 465\u2013492 (2001). https:\/\/doi.org\/10.1007\/s00454-001-0043-x","journal-title":"Discret. Comput. Geom."},{"issue":"1\u20132","key":"17_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. Theory Appl. 9(1\u20132), 3\u201324 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(97)00014-X","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1051\/ita\/2011106","volume":"45","author":"MR Cerioli","year":"2011","unstructured":"Cerioli, M.R., Faria, L., Ferreira, T.O., Protti, F.: A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. RAIRO Theor. Inf. Appl. 45(3), 331\u2013346 (2011). https:\/\/doi.org\/10.1051\/ita\/2011106","journal-title":"RAIRO Theor. Inf. Appl."},{"doi-asserted-by":"crossref","unstructured":"Chaplick, S., F\u00f6rster, H., Kryven, M., Wolff, A.: On arrangements of orthogonal circles. ArXiv report (2019). https:\/\/arxiv.org\/abs\/1907.08121","key":"17_CR5","DOI":"10.1007\/978-3-030-35802-0_17"},{"issue":"1\u20133","key":"17_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86(1\u20133), 165\u2013177 (1990). https:\/\/doi.org\/10.1016\/0012-365X(90)90358-O","journal-title":"Discret. Math."},{"key":"17_CR7","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River (1999)"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00373-011-1026-1","volume":"27","author":"A Dumitrescu","year":"2011","unstructured":"Dumitrescu, A., Pach, J.: Minimum clique partition in unit disk graphs. Graphs Combin. 27(3), 399\u2013411 (2011). https:\/\/doi.org\/10.1007\/s00373-011-1026-1","journal-title":"Graphs Combin."},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(97)84223-5","volume":"169","author":"P Eades","year":"1996","unstructured":"Eades, P., Whitesides, S.: The logic engine and the realization problem for nearest neighbor graphs. Theoret. Comput. Sci. 169(1), 23\u201337 (1996). https:\/\/doi.org\/10.1016\/S0304-3975(97)84223-5","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Eppstein, D.: Circles crossing at equal angles (2018). https:\/\/11011110.github.io\/blog\/2018\/12\/22\/circles-crossing-equal.html. Accessed 11 May 2019","key":"17_CR10"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73915-1_39","volume-title":"Graph Drawing and Network Visualization","author":"D Eppstein","year":"2018","unstructured":"Eppstein, D.: Triangle-free penny graphs: degeneracy, choosability, and edge count. In: Frati, F., Ma, K.L. (eds.) GD 2017. LNCS, vol. 10692. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_39. https:\/\/arxiv.org\/abs\/1708.05152"},{"key":"17_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-80303-0","volume-title":"Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry","author":"S Felsner","year":"2004","unstructured":"Felsner, S.: Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-322-80303-0"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-73915-1_11","volume-title":"Graph Drawing and Network Visualization","author":"S Felsner","year":"2018","unstructured":"Felsner, S., Scheucher, M.: Arrangements of pseudocircles: triangles and drawings. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 127\u2013139. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_11"},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1090\/S0002-9939-1984-0760946-2","volume":"92","author":"Z F\u00fcredi","year":"1984","unstructured":"F\u00fcredi, Z., Pal\u00e1sti, I.: Arrangements of lines with a large number of triangles. Proc. Amer. Math. Soc. 92(4), 561\u2013566 (1984). https:\/\/doi.org\/10.1090\/S0002-9939-1984-0760946-2","journal-title":"Proc. Amer. Math. Soc."},{"doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Arrangements and spreads. In: CBMS Regional Conference Series in Mathmatics, vol. 10. AMS, Providence (1972)","key":"17_CR15","DOI":"10.1090\/cbms\/010"},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s004930200012","volume":"22","author":"A Gy\u00e1rf\u00e1s","year":"2002","unstructured":"Gy\u00e1rf\u00e1s, A., Hubenko, A., Solymosi, J.: Large cliques in $${C}_4$$-free graphs. Combinatorica 22(2), 269\u2013274 (2002). https:\/\/doi.org\/10.1007\/s004930200012","journal-title":"Combinatorica"},{"issue":"1\u20133","key":"17_CR17","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":"17_CR18","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s00454-012-9394-8","volume":"47","author":"RJ Kang","year":"2012","unstructured":"Kang, R.J., M\u00fcller, T.: Sphere and dot product representations of graphs. Discret. Comput. Geom. 47(3), 548\u2013568 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9394-8","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"17_CR19","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. Discret. Comput. Geom. 51(4), 896\u2013925 (2014). https:\/\/doi.org\/10.1007\/s00454-014-9583-8","journal-title":"Discret. Comput. Geom."},{"key":"17_CR20","volume-title":"Excursions in Geometry","author":"CS Ogilvy","year":"1969","unstructured":"Ogilvy, C.S.: Excursions in Geometry. Oxford University Press, New York (1969)"},{"key":"17_CR21","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J Pach","year":"1995","unstructured":"Pach, J., Agarwal, K.P.: Combinatorial Geometry. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Hoboken (1995)"},{"issue":"4","key":"17_CR22","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s00454-002-2892-3","volume":"28","author":"R Pinchasi","year":"2002","unstructured":"Pinchasi, R.: Gallai-Sylvester theorem for pairwise intersecting unit circles. Discret. Comput. Geom. 28(4), 607\u2013624 (2002). https:\/\/doi.org\/10.1007\/s00454-002-2892-3","journal-title":"Discret. Comput. Geom."},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1515\/crll.1826.1.349","volume":"1","author":"J Steiner","year":"1826","unstructured":"Steiner, J.: Einige Gesetze \u00fcber die Theilung der Ebene und des Raumes. Journal f\u00fcr die reine und angewandte Mathematik 1, 349\u2013364 (1826). https:\/\/doi.org\/10.1515\/crll.1826.1.349","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"unstructured":"Weisstein, E.W.: Gauss-Bonnet formula (2019). http:\/\/mathworld.wolfram.com\/Gauss-BonnetFormula.html. Accessed 27 July 2019","key":"17_CR24"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:03:58Z","timestamp":1701133438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}]}}