{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:46:18Z","timestamp":1740109578503,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T00:00:00Z","timestamp":1681862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T00:00:00Z","timestamp":1681862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1907400"],"award-info":[{"award-number":["1907400"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s00454-023-00496-y","type":"journal-article","created":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T14:03:27Z","timestamp":1681913007000},"page":"1241-1254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Stabbing Convex Bodies with Points, Lines, and Flats"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2638-9635","authenticated-orcid":false,"given":"Sariel","family":"Har-Peled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2971-398X","authenticated-orcid":false,"given":"Mitchell","family":"Jones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,19]]},"reference":[{"issue":"3","key":"496_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1017\/S0963548300000225","volume":"1","author":"N Alon","year":"1992","unstructured":"Alon, N., B\u00e1r\u00e1ny, I., F\u00fcredi, Z., Kleitman, D.J.: Point selections and weak $$\\varepsilon $$-nets for convex hulls. Comb. Probab. Comput. 1(3), 189\u2013200 (1992)","journal-title":"Comb. Probab. Comput."},{"issue":"2","key":"496_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02123008","volume":"10","author":"I B\u00e1r\u00e1ny","year":"1990","unstructured":"B\u00e1r\u00e1ny, I., F\u00fcredi, Z., Lov\u00e1sz, L.: On the number of halving planes. Combinatorica 10(2), 175\u2013183 (1990)","journal-title":"Combinatorica"},{"key":"496_CR3","doi-asserted-by":"crossref","unstructured":"Bukh, B., Matou\u0161ek, J., Nivasch, G.: Lower bounds for weak epsilon-nets and stair-convexity. In: 25th Annual Symposium on Computational Geometry (Aarhus 2009), pp. 1\u201310. ACM, New York (2009)","DOI":"10.1145\/1542362.1542365"},{"key":"496_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method","author":"B Chazelle","year":"2000","unstructured":"Chazelle, B.: The Discrepancy Method. Cambridge University Press, Cambridge (2000)"},{"issue":"1","key":"496_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02574025","volume":"13","author":"B Chazelle","year":"1995","unstructured":"Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Sharir, M., Welzl, E.: Improved bounds on weak $$\\varepsilon $$-nets for convex sets. Discrete Comput. Geom. 13(1), 1\u201315 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"496_CR6","series-title":"Mathematical Surveys and Monographs","doi-asserted-by":"crossref","DOI":"10.1090\/surv\/173","volume-title":"Geometric Approximation Algorithms","author":"S Har-Peled","year":"2011","unstructured":"Har-Peled, S.: Geometric Approximation Algorithms. Mathematical Surveys and Monographs, vol. 173. American Mathematical Society, Providence (2011)"},{"key":"496_CR7","unstructured":"Har-Peled, S., Jones, M.: Stabbing convex bodies with lines and flats. In: 37th International Symposium on Computational Geometry. Leibniz Int. Proc. Inform., vol. 189, #\u00a042. Leibniz-Zent. Inform., Wadern (2021)"},{"issue":"2","key":"496_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: $$\\varepsilon $$-nets and simplex range queries. Discrete Comput. Geom. 2(2), 127\u2013151 (1987)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"496_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200907","volume":"17","author":"N Linial","year":"1997","unstructured":"Linial, N., Luby, M., Saks, M., Zuckerman, D.: Efficient construction of a small hitting set for combinatorial rectangles in high dimension. Combinatorica 17(2), 215\u2013234 (1997)","journal-title":"Combinatorica"},{"key":"496_CR10","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy","author":"J Matou\u0161ek","year":"1999","unstructured":"Matou\u0161ek, J.: Geometric Discrepancy. Algorithms and Combinatorics, vol. 18. Springer, Berlin (1999)"},{"key":"496_CR11","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York (2002)"},{"issue":"2","key":"496_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00454-004-1116-4","volume":"32","author":"J Matou\u0161ek","year":"2004","unstructured":"Matou\u0161ek, J., Wagner, U.: New constructions of weak $$\\varepsilon $$-nets. Discrete Comput. Geom. 32(2), 195\u2013206 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"496_CR13","unstructured":"Mustafa, N.H., Varadarajan, K.: Epsilon-approximations & epsilon-nets. In: Handbook of Discrete and Computational Geometry, 3rd edn, pp. 1241\u20131267. CRC Press, Boca Raton (2018)"},{"issue":"8","key":"496_CR14","doi-asserted-by":"publisher","first-page":"3501","DOI":"10.1137\/090764190","volume":"39","author":"Y Rabani","year":"2010","unstructured":"Rabani, Y., Shpilka, A.: Explicit construction of a small $$\\epsilon $$-net for linear threshold functions. SIAM J. Comput. 39(8), 3501\u20133520 (2010)","journal-title":"SIAM J. Comput."},{"key":"496_CR15","doi-asserted-by":"crossref","unstructured":"Rubin, N.: An improved bound for weak epsilon-nets in the plane. In: 59th Annual IEEE Symposium on Foundations of Computer Science (Paris 2018), pp. 224\u2013235. IEEE Computer Society, Los Alamitos (2018)","DOI":"10.1109\/FOCS.2018.00030"},{"key":"496_CR16","doi-asserted-by":"crossref","unstructured":"Rubin, N.: Stronger bounds for weak epsilon-nets in higher dimensions. In: 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 989\u20131002. ACM, New York (2021)","DOI":"10.1145\/3406325.3451062"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00496-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00496-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00496-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T05:30:47Z","timestamp":1683783047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00496-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,19]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["496"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00496-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2023,4,19]]},"assertion":[{"value":"5 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}