乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T00:11:38Z","timestamp":1704586298876},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T00:00:00Z","timestamp":1698105600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T00:00:00Z","timestamp":1698105600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100008394","name":"Natur og Univers, Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["DFF-7014-00404"],"id":[{"id":"10.13039\/100008394","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":[[2024,1]]},"DOI":"10.1007\/s00454-023-00574-1","type":"journal-article","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T16:02:29Z","timestamp":1698163349000},"page":"4-39","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Semialgebraic Range Reporting"],"prefix":"10.1007","volume":"71","author":[{"given":"Peyman","family":"Afshani","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8131-847X","authenticated-orcid":false,"given":"Pingan","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,24]]},"reference":[{"key":"574_CR1","unstructured":"Afshani, P., Cheng, P.: Lower bounds for semialgebraic range searching and stabbing problems. In: 37th International Symposium on Computational Geometry (2021). Leibniz Int. Proc. Inform., vol. 189, #\u00a08. Leibniz-Zent. Inform., Wadern (2021)"},{"key":"574_CR2","unstructured":"Afshani, P.: A new lower bound for semigroup orthogonal range searching. In: 35th International Symposium on Computational (Portland 2019). Leibniz Int. Proc. Inform., vol. 129, #\u00a03. Leibniz-Zent. Inform., Wadern (2019)"},{"key":"574_CR3","doi-asserted-by":"crossref","unstructured":"Afshani, P.: Improved pointer machine and I\/O lower bounds for simplex range reporting and related problems. In: 28th International Symposium on Computational Geometry (Chapel Hill 2012), pp. 339\u2013346. ACM, New York (2012)","DOI":"10.1145\/2261250.2261301"},{"key":"574_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K.: Simplex range searching and its variants: a review. In: A Journey Through Discrete Mathematics, pp. 1\u201330. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-44479-6_1"},{"issue":"2","key":"574_CR5","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/19M1268550","volume":"50","author":"PK Agarwal","year":"2021","unstructured":"Agarwal, P.K., Aronov, B., Ezra, E., Zahl, J.: Efficient algorithm for generalized polynomial partitioning and its applications. SIAM J. Comput. 50(2), 760\u2013787 (2021)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"574_CR6","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1137\/120890855","volume":"42","author":"PK Agarwal","year":"2013","unstructured":"Agarwal, P.K., Matou\u0161ek, J., Sharir, M.: On range searching with semialgebraic sets. II. SIAM J. Comput. 42(6), 2039\u20132062 (2013)","journal-title":"II. SIAM J. Comput."},{"key":"574_CR7","doi-asserted-by":"crossref","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: On the importance of idempotence. In: 38th Annual ACM Symposium on Theory of Computing (Seattle 2006), pp. 564\u2013573. ACM, New York (2006)","DOI":"10.1145\/1132516.1132598"},{"issue":"4","key":"574_CR8","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s00454-012-9412-x","volume":"47","author":"S Arya","year":"2012","unstructured":"Arya, S., Mount, D.M., Xia, J.: Tight lower bounds for halfspace range searching. Discrete Comput. Geom. 47(4), 711\u2013730 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"574_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02573971","volume":"10","author":"H Br\u00f6nnimann","year":"1993","unstructured":"Br\u00f6nnimann, H., Chazelle, B., Pach, J.: How hard is half-space range searching? Discrete Comput. Geom. 10(2), 143\u2013155 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"574_CR10","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1090\/S0894-0347-1989-1001852-0","volume":"2","author":"B Chazelle","year":"1989","unstructured":"Chazelle, B.: Lower bounds on the complexity of polytope range searching. J. Am. Math. Soc. 2(4), 637\u2013666 (1989)","journal-title":"J. Am. Math. Soc."},{"issue":"2","key":"574_CR11","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/77600.77614","volume":"37","author":"B Chazelle","year":"1990","unstructured":"Chazelle, B.: Lower bounds for orthogonal range searching. I. The reporting case. J. Assoc. Comput. Mach. 37(2), 200\u2013212 (1990)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"574_CR12","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/79147.79149","volume":"37","author":"B Chazelle","year":"1990","unstructured":"Chazelle, B.: Lower bounds for orthogonal range searching. II. The arithmetic model. J. Assoc. Comput. Mach. 37(3), 439\u2013463 (1990)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"574_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0925-7721(95)00002-X","volume":"5","author":"B Chazelle","year":"1996","unstructured":"Chazelle, B., Rosenberg, B.: Simplex range reporting on a pointer machine. Comput. Geom. 5(5), 237\u2013247 (1996)","journal-title":"Comput. Geom."},{"key":"574_CR14","unstructured":"Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C.D. (eds.): Handbook of Discrete and Computational Geometry. Discrete Mathematics and Its Applications (Boca Raton). CRC Press, Boca Raton (2018)"},{"issue":"1","key":"574_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.4007\/annals.2015.181.1.2","volume":"181","author":"L Guth","year":"2015","unstructured":"Guth, L., Katz, N.H.: On the Erd\u0151s distinct distances problem in the plane. Ann. Math. 181(1), 155\u2013190 (2015)","journal-title":"Ann. Math."},{"key":"574_CR16","first-page":"360","volume":"22","author":"CGJ Jacobi","year":"1841","unstructured":"Jacobi, C.G.J.: De functionibus alternantibus earumque divisione per productum e differentiis elementorum conflatum. J. Reine Angew. Math. 22, 360\u2013371 (1841)","journal-title":"J. Reine Angew. Math."},{"issue":"2","key":"574_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02573972","volume":"10","author":"J Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Range searching with efficient hierarchical cuttings. Discrete Comput. Geom. 10(2), 157\u2013182 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"574_CR18","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1145\/197405.197408","volume":"26","author":"J Matou\u0161ek","year":"1994","unstructured":"Matou\u0161ek, J.: Geometric range searching. ACM Comput. Surv. 26(4), 421\u2013461 (1994)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"574_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s00454-015-9701-2","volume":"54","author":"J Matou\u0161ek","year":"2015","unstructured":"Matou\u0161ek, J., Pat\u00e1kov\u00e1, Z.: Multilevel polynomial partitions and simplified range searching. Discrete Comput. Geom. 54(1), 22\u201341 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"574_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C., Yao, F.F.: A general approach to $$d$$-dimensional geometric queries. In: 17th Annual ACM Symposium on Theory of Computing (Providence 1985), pp. 163\u2013168. ACM, New York (1985)","DOI":"10.1145\/22145.22163"},{"key":"574_CR21","first-page":"97","volume":"33","author":"A Young","year":"1901","unstructured":"Young, A.: On quantitative substitutional analysis. Proc. Lond. Math. Soc. 33, 97\u2013146 (1901)","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00574-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00574-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00574-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T20:02:07Z","timestamp":1704571327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00574-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,24]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["574"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00574-1","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,24]]},"assertion":[{"value":"31 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}