{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T07:50:52Z","timestamp":1757577052930,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206238"},{"type":"electronic","value":"9783031206245"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20624-5_41","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T15:18:05Z","timestamp":1666970285000},"page":"679-695","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Piercing Pairwise Intersecting Convex Shapes in\u00a0the\u00a0Plane"],"prefix":"10.1007","author":[{"given":"Saman","family":"Bazargani","sequence":"first","affiliation":[]},{"given":"Ahmad","family":"Biniaz","sequence":"additional","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-58218-5_1","volume-title":"Algorithm Theory \u2014 SWAT 1994","author":"Pankaj K. Agarwal","year":"1994","unstructured":"Agarwal, Pankaj K.., Katz, Matthew J.., Sharir, Micha: Computing depth orders and related problems. In: Schmidt, Erik M.., Skyum, Sven (eds.) SWAT 1994. LNCS, vol. 824, pp. 1\u201312. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58218-5_1"},{"issue":"4","key":"41_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0925-7721(95)00005-8","volume":"5","author":"PK Agarwal","year":"1995","unstructured":"Agarwal, P.K., Katz, M.J., Sharir, M.: Computing depth orders for fat objects and related problems. Comput. Geom. Theory App. 5(4), 187\u2013206 (1995)","journal-title":"Comput. Geom. Theory App."},{"key":"41_CR3","unstructured":"Biniaz, A., Bose, P., Wang, Y.: Simple linear time algorithms for piercing pairwise intersecting disks. In: He, M., D., Sheehy, M., (eds.) Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021, 10\u201312 August 2021, Dalhousie University, Halifax, Nova Scotia, Canada, pp. 228\u2013236 (2021)"},{"issue":"1\/2","key":"41_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1142\/S0218195997000090","volume":"7","author":"P Bose","year":"1997","unstructured":"Bose, P., et al.: The floodlight problem. Int. J. Comput. Geom. Appl. 7(1\/2), 153\u2013163 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"41_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1967-0206818-3","volume":"18","author":"GD Chakerian","year":"1967","unstructured":"Chakerian, G.D., Stein, S.K.: Some intersection properties of convex bodies. Proc. Am. Math. Soc. 18(1), 109\u2013112 (1967)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1\u20132","key":"41_CR6","first-page":"111","volume":"21","author":"L Danzer","year":"1986","unstructured":"Danzer, L.: Zur L\u00f6sung des Gallaischen Problems \u00fcber Kreisscheiben in der Euklidischen Ebene. Stud. Sci. Math. Hung. 21(1\u20132), 111\u2013134 (1986)","journal-title":"Stud. Sci. Math. Hung."},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Efrat, A., Rote, G., Sharir, M.: On the union of fat wedges and separating a collection of segments by a line. In: Lubiw, A., Urrutia, J., (eds.), Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, pp. 115\u2013120 (1993)","DOI":"10.1016\/0925-7721(93)90018-2"},{"volume-title":"Handbook of Discrete and Computational Geometry","year":"1997","key":"41_CR8","unstructured":"Goodman, J.E., O\u2019Rourke, J. (eds.): Handbook of Discrete and Computational Geometry. CRC Press Inc., USA (1997)"},{"key":"41_CR9","first-page":"155","volume":"18","author":"B Gr\u00fcnbaum","year":"1959","unstructured":"Gr\u00fcnbaum, B.: On intersections of similar sets. Portugal. Math. 18, 155\u2013164 (1959)","journal-title":"Portugal. Math."},{"key":"41_CR10","unstructured":"Har-Peled, S., et al.: Stabbing pairwise intersecting disks by five points. In: 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"41_CR11","unstructured":"Ed. Helly. \u00dcber mengen konvexer k\u00f6rper mit gemeinschaftlichen punkte. Jahresbericht der Deutschen Mathematiker-Vereinigung. 32, 175\u2013176 (1923)"},{"issue":"2","key":"41_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s004540010040","volume":"24","author":"RN Karasev","year":"2000","unstructured":"Karasev, R.N.: Transversals for families of translates of a two-dimensional convex compact set. Disc. Comput. Geom. 24(2), 345\u2013354 (2000)","journal-title":"Disc. Comput. Geom."},{"issue":"4","key":"41_CR13","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1007\/s00454-007-9040-z","volume":"39","author":"RN Karasev","year":"2008","unstructured":"Karasev, R.N.: Piercing families of convex sets with the d-intersection property in $$\\mathbb{R} ^d$$. Disc. Comput. Geom. 39(4), 766\u2013777 (2008)","journal-title":"Disc. Comput. Geom."},{"issue":"6","key":"41_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0925-7721(96)00027-2","volume":"8","author":"MJ Katz","year":"1997","unstructured":"Katz, M.J.: 3-d vertical ray shooting and 2-d point enclosure, range searching, and arc shooting amidst convex fat objects. Comput. Geom. 8(6), 299\u2013316 (1997)","journal-title":"Comput. Geom."},{"issue":"4","key":"41_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0925-7721(92)90024-M","volume":"2","author":"MJ Katz","year":"1992","unstructured":"Katz, M.J., Overmars, M.H., Sharir, M.: Efficient hidden surface removal for objects with small union size. Comput. Geom. 2(4), 223\u2013234 (1992)","journal-title":"Comput. Geom."},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Kim, S.-J., Nakprasit, K., Pelsmajer, M.J., Skokan, J.: Transversal numbers of translates of a convex body. Disc. Math. 306(18), 2166\u20132173 (2006)","DOI":"10.1016\/j.disc.2006.05.014"},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1137\/S009753979018330X","volume":"23","author":"J Matousek","year":"1994","unstructured":"Matousek, J., Pach, J., Sharir, M., Sifrony, S., Welzl, E.: Fat triangles determine linearly many holes. SIAM J. Comput. 23, 154\u2013169 (1994)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"41_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(00)00227-9","volume":"265","author":"F Nielsen","year":"2001","unstructured":"Nielsen, F.: On point covers of $$c$$-oriented polygons. Theo. Comp. Sci. 265(1\u20132), 17\u201329 (2001)","journal-title":"Theo. Comp. Sci."},{"issue":"3","key":"41_CR19","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1006\/jagm.1996.0063","volume":"21","author":"MH Overmars","year":"1996","unstructured":"Overmars, M.H., van der Stappen, F.A.: Range searching and point location among fat objects. J. Algorithms 21(3), 629\u2013656 (1996)","journal-title":"J. Algorithms"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Pach, J., Safruti, I., Sharir, M.: The union of congruent cubes in three dimensions. In Proceedings of the Seventeenth Annual Symposium on Computational Geometry, SCG 2001, pp. 19\u201328. Association for Computing Machinery, New York, NY, USA (2001)","DOI":"10.1145\/378583.378598"},{"key":"41_CR21","unstructured":"Carmi, P., Morin, P., Katz, M.J.: Stabbing pairwise intersecting disks by four points (2020)"},{"issue":"2","key":"41_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0925-7721(96)00019-3","volume":"10","author":"O Schwarzkopf","year":"1998","unstructured":"Schwarzkopf, O., Fuchs, U., Rote, G., Welzl, E.: Approximation of convex figures by pairs of rectangles. Comput. Geom. 10(2), 77\u201387 (1998)","journal-title":"Comput. Geom."},{"key":"41_CR23","first-page":"273","volume":"26","author":"L Stach\u00f3","year":"1965","unstructured":"Stach\u00f3, L.: \u00dcber ein Problem f\u00fcr Kreisscheibenfamilien. Acta Scientiarum Mathematicarum (Szeged) 26, 273\u2013282 (1965)","journal-title":"Acta Scientiarum Mathematicarum (Szeged)"},{"key":"41_CR24","unstructured":"Stach\u00f3, L.: A solution of Gallai\u2019s problem on pinning down circles. Mat. Lapok. 32(1\u20133), 19\u201347 (1981\/1984)"},{"issue":"4","key":"41_CR25","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0925-7721(96)00016-8","volume":"9","author":"MJ van Kreveld","year":"1998","unstructured":"van Kreveld, M.J.: On fat partitioning, fat covering and the union size of polygons. Comput. Geom. 9(4), 197\u2013210 (1998)","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","LATIN 2022: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20624-5_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T23:09:04Z","timestamp":1667084944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20624-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206238","9783031206245"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20624-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guanajuato","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/delta.cs.cinvestav.mx\/~francisco\/Latin22\/","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":"114","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":"46","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":"40% - 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":"4","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.7","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)"}}]}}