{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T15:07:25Z","timestamp":1767193645930,"version":"3.48.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10878-025-01373-5","type":"journal-article","created":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T20:12:58Z","timestamp":1762632778000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dominance for enclosure problems"],"prefix":"10.1007","volume":"50","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":[[2025,11,8]]},"reference":[{"key":"1373_CR1","doi-asserted-by":"crossref","unstructured":"Afshani P (2008) On dominance reporting in 3d. In Algorithms - ESA 2008, LNCS-5593 , pp.\u00a041\u201351","DOI":"10.1007\/978-3-540-87744-8_4"},{"key":"1373_CR2","doi-asserted-by":"publisher","first-page":"115054","DOI":"10.1016\/j.tcs.2024.115054","volume":"1030","author":"W Akram","year":"2025","unstructured":"Akram W, Saxena S (2025) Point enclosure problem for homothetic polygons. Theoret Comput Sci 1030:115054","journal-title":"Theoret Comput Sci"},{"key":"1373_CR3","doi-asserted-by":"crossref","unstructured":"Akram W, Saxena S (2024) Dominance for enclosure problems. In Proceedings of the 35th International Workshop on Combinatorial Algorithms (IWOCA 2024) , pp.\u00a0408\u2013420","DOI":"10.1007\/978-3-031-63021-7_31"},{"issue":"1","key":"1373_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 (1997) New results on intersection query problems. Comput J 40(1):22\u201329","journal-title":"Comput J"},{"issue":"3","key":"1373_CR5","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B Chazelle","year":"1986","unstructured":"Chazelle B (1986) Filtering search: a new approach to query-answering. SIAM J Comput 15(3):703\u2013724","journal-title":"SIAM J Comput"},{"issue":"2","key":"1373_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02187875","volume":"2","author":"B Chazelle","year":"1987","unstructured":"Chazelle B, Edelsbrunner H (1987) Linear space data structures for two types of range search. Discrete Computat. Geometry 2(2):113\u2013126","journal-title":"Discrete Computat. Geometry"},{"issue":"3","key":"1373_CR7","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 MH (1982) On the equivalence of some rectangle problems. Inf Process Lett 14(3):124\u2013127","journal-title":"Inf Process Lett"},{"issue":"2","key":"1373_CR8","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 (1982) Polygonal intersection searching. Inf Process Lett 14(2):74\u201379","journal-title":"Inf Process Lett"},{"issue":"1","key":"1373_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 RH (1983) Stabbing c-oriented polygons Information processing letters 16(1):35\u201340","journal-title":"Stabbing c-oriented polygons Information processing letters"},{"issue":"3","key":"1373_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0019-9958(84)80011-X","volume":"63","author":"RH G\u00fcting","year":"1984","unstructured":"G\u00fcting RH (1984) Dynamic c-oriented polygonal intersection searching. Inf Control 63(3):143\u2013163","journal-title":"Inf Control"},{"issue":"6","key":"1373_CR11","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 (1998) Algorithms for three-dimensional dominance searching in linear space. Inf Process Lett 66(6):277\u2013283","journal-title":"Inf Process Lett"},{"key":"1373_CR12","doi-asserted-by":"crossref","unstructured":"Makris C, Tsakalidis K (2012) An improved algorithm for static 3d dominance reporting in the pointer machine. In Algorithms and Computation, ISSAC 2012, LNCS-7676 , pp.\u00a0568\u2013577","DOI":"10.1007\/978-3-642-35261-4_59"},{"issue":"2","key":"1373_CR13","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0890-5401(87)90045-9","volume":"72","author":"GHE Rawlins","year":"1987","unstructured":"Rawlins GHE, Wood D (1987) Optimal computation of finitely oriented convex hulls. Inf Comput 72(2):150\u2013166","journal-title":"Inf Comput"},{"issue":"9","key":"1373_CR14","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 (2009) Dominance made simple. Inf Process Lett 109(9):419\u2013421","journal-title":"Inf Process Lett"},{"issue":"04","key":"1373_CR15","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1142\/S0129054104002686","volume":"15","author":"Q Shi","year":"2004","unstructured":"Shi Q, JaJa J (2004) Fast algorithms for 3-d dominance reporting and counting. Int J Found Comput Sci 15(04):673\u2013684","journal-title":"Int J Found Comput Sci"},{"issue":"4","key":"1373_CR16","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 (1991) The intersection searching problem for c-oriented polygons. Inf Process Lett 37(4):201\u2013204","journal-title":"Inf Process Lett"},{"key":"1373_CR17","volume-title":"Calculus Analytic Geometry","author":"G Thomas","year":"1984","unstructured":"Thomas G, Finney R (1984) Calculus Analytic Geometry. Addison-Wesley Publishing Company, World student series"},{"key":"1373_CR18","unstructured":"Trirectangular tetrahedron. https:\/\/en.wikipedia.org\/w\/index.php?title=Trirectangular_tetrahedron&oldid=1101419105"},{"issue":"01","key":"1373_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TC.1982.1675881","volume":"31","author":"VK Vaishnavi","year":"1982","unstructured":"Vaishnavi VK (1982) Computing point enclosures. IEEE Trans Comput 31(01):22\u201329","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"1373_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02240065","volume":"36","author":"P Widmayer","year":"1986","unstructured":"Widmayer P, Wu Y, Schlag MDF, Wong C (1986) On some union and intersection problems for polygons with fixed orientations. Computing 36(3):183\u2013197","journal-title":"Computing"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01373-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01373-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01373-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T15:03:13Z","timestamp":1767193393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01373-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["1373"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01373-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"13 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"No funding was received for this study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding Information"}}],"article-number":"41"}}