{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:30:46Z","timestamp":1742913046484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343469"},{"type":"electronic","value":"9783031343476"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34347-6_2","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T23:03:35Z","timestamp":1685747015000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Point Enclosure Problem for\u00a0Homothetic Polygons"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-4960-8673","authenticated-orcid":false,"given":"Waseem","family":"Akram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9581-1732","authenticated-orcid":false,"given":"Sanjeev","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Afshani, P., Arge, L., Larsen, K.G.: Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry, SoCG 2012, pp. 323\u2013332. Association for Computing Machinery, New York (2012)","DOI":"10.1145\/2261250.2261299"},{"key":"2_CR2","unstructured":"Akram, W., Saxena, S.: Dominance for containment problems (2022)"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-77974-2_10","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg","year":"2008","unstructured":"Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, pp. 219\u2013241. Springer, Heidelberg (2008)"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1093\/comjnl\/40.1.22","volume":"40","author":"P Bozanis","year":"1997","unstructured":"Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New results on intersection query problems. Comput. J. 40(1), 22\u201329 (1997)","journal-title":"Comput. J."},{"issue":"1","key":"2_CR5","first-page":"399","volume":"13","author":"T Chan","year":"2022","unstructured":"Chan, T., Nekrich, Y., Rahul, S., Tsakalidis, K.: Orthogonal point location and rectangle stabbing queries in 3-D. J. Comput. Geom. 13(1), 399\u2013428 (2022)","journal-title":"J. Comput. Geom."},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B Chazelle","year":"1986","unstructured":"Chazelle, B.: Filtering search: a new approach to query-answering. SIAM J. Comput. 15(3), 703\u2013724 (1986)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discret. Comput. Geom. 6(3), 485\u2013524 (1991). https:\/\/doi.org\/10.1007\/BF02574703","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02187875","volume":"2","author":"B Chazelle","year":"1987","unstructured":"Chazelle, B., Edelsbrunner, H.: Linear space data structures for two types of range search. Discret. Comput. Geom. 2(2), 113\u2013126 (1987). https:\/\/doi.org\/10.1007\/BF02187875","journal-title":"Discret. Comput. Geom."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Guibas, L.: Fractional cascading: I. A data structuring technique. Algorithmica 1, 133\u2013162 (1986)","DOI":"10.1007\/BF01840440"},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/0196-6774(92)90062-H","volume":"13","author":"SW Cheng","year":"1992","unstructured":"Cheng, S.W., Janardan, R.: Algorithms for ray-shooting and intersection searching. J. Algorithms 13(4), 670\u2013692 (1992)","journal-title":"J. Algorithms"},{"issue":"9","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/5.163409","volume":"80","author":"Y-J Chiang","year":"1992","unstructured":"Chiang, Y.-J., Tamassia, R.: Dynamic algorithms in computational geometry. Proc. IEEE 80(9), 1412\u20131434 (1992)","journal-title":"Proc. IEEE"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1006\/jagm.1995.1038","volume":"19","author":"P Gupta","year":"1995","unstructured":"Gupta, P., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. J. Algorithms 19(2), 282\u2013317 (1995)","journal-title":"J. Algorithms"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0020-0190(83)90010-8","volume":"16","author":"RH G\u00fcting","year":"1983","unstructured":"G\u00fcting, R.H.: Stabbing C-oriented polygons. Inf. Process. Lett. 16(1), 35\u201340 (1983)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"2_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."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Katz, M.J., Nielsen, F.: On piercing sets of objects. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, pp. 113\u2013121 (1996)","DOI":"10.1145\/237218.237253"},{"issue":"6","key":"2_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(98)00075-1","volume":"66","author":"C Makris","year":"1998","unstructured":"Makris, C., Tsakalidis, A.: Algorithms for three-dimensional dominance searching in linear space. Inf. Process. Lett. 66(6), 277\u2013283 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20134","key":"2_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K Mehlhorn","year":"1990","unstructured":"Mehlhorn, K., N\u00e4her, S.: Dynamic fractional cascading. Algorithmica 5(1\u20134), 215\u2013241 (1990)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"2_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(00)00227-9","volume":"263","author":"F Nielsen","year":"2001","unstructured":"Nielsen, F.: On point covers of C-oriented polygons. Theor. Comput. Sci. 263(1\u20132), 17\u201329 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01931656","volume":"30","author":"MH Overmars","year":"1990","unstructured":"Overmars, M.H., Schipper, H., Sharir, M.: Storing line segments in partition trees. BIT Numer. Math. 30(3), 385\u2013403 (1990)","journal-title":"BIT Numer. Math."},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-1-4612-1098-6_8","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, pp. 323\u2013373. Springer, New York (1985)"},{"issue":"9","key":"2_CR21","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ipl.2008.12.006","volume":"109","author":"S Saxena","year":"2009","unstructured":"Saxena, S.: Dominance made simple. Inf. Process. Lett. 109(9), 419\u2013421 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"2_CR22","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/BF02574706","volume":"6","author":"M Sharir","year":"1991","unstructured":"Sharir, M.: On k-sets in arrangements of curves and surfaces. Discret. Comput. Geom. 6(4), 593\u2013613 (1991)","journal-title":"Discret. Comput. Geom."},{"issue":"04","key":"2_CR23","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1142\/S0129054104002686","volume":"15","author":"Q Shi","year":"2004","unstructured":"Shi, Q., JaJa, J.: Fast algorithms for 3-D dominance reporting and counting. Int. J. Found. Comput. Sci. 15(04), 673\u2013684 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"01","key":"2_CR24","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TC.1982.1675881","volume":"31","author":"VK Vaishnavi","year":"1982","unstructured":"Vaishnavi, V.K.: Computing point enclosures. IEEE Trans. Comput. 31(01), 22\u201329 (1982)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34347-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T14:06:54Z","timestamp":1712758014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34347-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343469","9783031343476"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34347-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2023.csie.ncku.edu.tw\/","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":"86","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":"33","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":"38% - 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.04","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":"5.69","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)"}}]}}