{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:18:43Z","timestamp":1767212323582,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_31","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"408-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dominance for\u00a0Enclosure Problems"],"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":[[2024,6,22]]},"reference":[{"key":"31_CR1","unstructured":"Trirectangular tetrahedron. https:\/\/en.wikipedia.org\/w\/index.php?title=Trirectangular_tetrahedron &oldid=1101419105"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-87744-8_4","volume-title":"Algorithms - ESA 2008","author":"P Afshani","year":"2008","unstructured":"Afshani, P.: On dominance reporting in 3D. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 41\u201351. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_4"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-031-34347-6_2","volume-title":"Combinatorial Algorithms","author":"W Akram","year":"2023","unstructured":"Akram, W., Saxena, S.: Point enclosure problem for homothetic polygons. In: Hsieh, S.Y., Hung, L.J., Lee, C.W. (eds.) IWOCA 2023. LNCS, vol. 13889, pp. 13\u201324. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-34347-6_2"},{"issue":"1","key":"31_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":"3","key":"31_CR5","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":"2","key":"31_CR6","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. Discrete Comput. Geom. 2(2), 113\u2013126 (1987)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/0020-0190(82)90090-4","volume":"14","author":"H Edelsbrunner","year":"1982","unstructured":"Edelsbrunner, H., Maurer, H., Kirkpatrick, D.: Polygonal intersection searching. Inf. Process. Lett. 14(2), 74\u201379 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/0020-0190(82)90068-0","volume":"14","author":"H Edelsbrunner","year":"1982","unstructured":"Edelsbrunner, H., Overmars, M.H.: On the equivalence of some rectangle problems. Inf. Process. Lett. 14(3), 124\u2013127 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"31_CR9","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":"31_CR10","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."},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-35261-4_59","volume-title":"Algorithms and Computation","author":"C Makris","year":"2012","unstructured":"Makris, C., Tsakalidis, K.: An improved algorithm for static 3D dominance reporting in the pointer machine. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 568\u2013577. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35261-4_59"},{"issue":"9","key":"31_CR12","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":"04","key":"31_CR13","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":"4","key":"31_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0020-0190(91)90189-O","volume":"37","author":"X Tan","year":"1991","unstructured":"Tan, X., Hirata, T., Inagaki, Y.: The intersection searching problem for C-oriented polygons. Inf. Process. Lett. 37(4), 201\u2013204 (1991)","journal-title":"Inf. Process. Lett."},{"key":"31_CR15","unstructured":"Thomas, G., Finney, R.: Calculus and Analytic Geometry. World Student Series. Addison-Wesley Publishing Company (1984)"},{"issue":"01","key":"31_CR16","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-63021-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:17:30Z","timestamp":1718975850000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","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":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}