乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T08:26:04Z","timestamp":1722414364708},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,20]],"date-time":"2009-02-20T00:00:00Z","timestamp":1235088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s00454-009-9140-z","type":"journal-article","created":{"date-parts":[[2009,2,19]],"date-time":"2009-02-19T21:51:47Z","timestamp":1235080307000},"page":"398-443","source":"Crossref","is-referenced-by-count":12,"title":["The Effect of Corners on the Complexity of\u00a0Approximate Range Searching"],"prefix":"10.1007","volume":"41","author":[{"given":"Sunil","family":"Arya","sequence":"first","affiliation":[]},{"given":"Theocharis","family":"Malamatos","sequence":"additional","affiliation":[]},{"given":"David M.","family":"Mount","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,20]]},"reference":[{"key":"9140_CR1","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/conm\/223\/03131","volume-title":"Advances in Discrete and Computational Geometry","author":"P.K. Agarwal","year":"1999","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, pp. 1\u201356. American Mathematical Society, Providence (1999)"},{"key":"9140_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0925-7721(00)00022-5","volume":"17","author":"S. Arya","year":"2000","unstructured":"Arya, S., Mount, D.M.: Approximate range searching. Comput. Geom. Theory Appl. 17, 135\u2013152 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9140_CR3","doi-asserted-by":"crossref","unstructured":"Arya, S., Malamatos, T.: Linear-size approximate Voronoi diagrams. In: Proc. 13th Annu. ACM\u2013SIAM Sympos. Discrete Algorithms, pp.\u00a0147\u2013155 (2002)","DOI":"10.1145\/509907.510011"},{"key":"9140_CR4","doi-asserted-by":"crossref","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: Space-efficient approximate Voronoi diagrams. In: Proc. 34th Annu. ACM Sympos. Theory Comput., pp.\u00a0721\u2013730 (2002)","DOI":"10.1145\/509907.510011"},{"key":"9140_CR5","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: Space-time tradeoffs for approximate spherical range counting. In: Proc. 16th Annu. ACM\u2013SIAM Sympos. Discrete Algorithms, pp.\u00a0535\u2013544 (2005)"},{"key":"9140_CR6","doi-asserted-by":"crossref","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: On the importance of idempotence. In: Proc. 38th Annu. ACM Sympos. Theory Comput., pp.\u00a0564\u2013573 (2006)","DOI":"10.1145\/1132516.1132598"},{"key":"9140_CR7","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: Space-time tradeoffs for approximate spherical range counting. Technical Report CS\u2013TR\u20134842, Dept. of Computer Science, University of Maryland (2006)"},{"key":"9140_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/SIBGRAPI.2008.24","volume-title":"SIBGRAPI \u201908: Proceedings of the 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing","author":"S. Arya","year":"2008","unstructured":"Arya, S., da Fonseca, G.D., Mount, D.M.: Tradeoffs in approximate range searching made simpler. In: SIBGRAPI \u201908: Proceedings of the 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing, pp. 237\u2013244. IEEE Computer Society, Los Alamitos (2008)"},{"key":"9140_CR9","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/BF01452053","volume":"285","author":"I. B\u00e1r\u00e1ny","year":"1989","unstructured":"B\u00e1r\u00e1ny, I.: Intrinsic volumes and f-vectors of random polytopes. Math. Ann. 285, 671\u2013699 (1989)","journal-title":"Math. Ann."},{"key":"9140_CR10","unstructured":"B\u00e1r\u00e1ny, I.: The technique of M-regions and cap-coverings: A survey. In: Proc. III International Conference in Stochastic Geometry, Convex Bodies and Empirical Measures, Part II, Rendi. del Circ. Matemat. di Palermo, vol.\u00a065, pp.\u00a021\u201338 (2000)"},{"key":"9140_CR11","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1112\/S0025579300015266","volume":"35","author":"I. B\u00e1r\u00e1ny","year":"1988","unstructured":"B\u00e1r\u00e1ny, I., Larman, D.: Convex bodies, economic cap coverings, random polytopes. Mathematika 35, 274\u2013291 (1988)","journal-title":"Mathematika"},{"key":"9140_CR12","doi-asserted-by":"crossref","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 halfspace range searching? Discrete Comput. Geom. 10, 143\u2013155 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"9140_CR13","unstructured":"Chan, T.M., Snoeyink, J.: Algorithms for approximate nearest-neighbor queries. Manuscript (1995)"},{"key":"9140_CR14","doi-asserted-by":"crossref","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, 637\u2013666 (1989)","journal-title":"J. Am. Math. Soc."},{"key":"9140_CR15","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.comgeo.2007.05.008","volume":"39","author":"B. Chazelle","year":"2008","unstructured":"Chazelle, B., Liu, D., Magen, A.: Approximate range searching in higher dimension. Comput. Geom. Theory Appl. 39, 24\u201329 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9140_CR16","doi-asserted-by":"crossref","unstructured":"da Fonseca, G.D.: Approximate range searching: The absolute model. In: Proc. 10th Workshop Algorithms Data Struct., pp.\u00a02\u201314 (2007)","DOI":"10.1007\/978-3-540-73951-7_2"},{"key":"9140_CR17","doi-asserted-by":"crossref","first-page":"1968","DOI":"10.1137\/S0097539798337212","volume":"29","author":"J. Erickson","year":"2000","unstructured":"Erickson, J.: Space-time tradeoffs for emptiness queries. SIAM J. Comput. 29, 1968\u20131996 (2000)","journal-title":"SIAM J. Comput."},{"key":"9140_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/S0025579300002655","volume":"17","author":"G. Ewald","year":"1970","unstructured":"Ewald, G., Larman, D.G., Rogers, C.A.: The directions of the line segments and of the r-dimensional balls on the boundary of a convex body in Euclidean space. Mathematika 17, 1\u201320 (1970)","journal-title":"Mathematika"},{"key":"9140_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0210001","volume":"10","author":"M.L. Fredman","year":"1981","unstructured":"Fredman, M.L.: Lower bounds on the complexity of some optimal data structures. SIAM J. Comput. 10, 1\u201310 (1981)","journal-title":"SIAM J. Comput."},{"key":"9140_CR20","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol.\u00a02. Springer, Berlin (1988). 2nd edn. 1994"},{"issue":"2","key":"9140_CR21","doi-asserted-by":"crossref","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."},{"key":"9140_CR22","doi-asserted-by":"crossref","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, 421\u2013461 (1994)","journal-title":"ACM Comput. Surv."},{"key":"9140_CR23","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0214022","volume":"14","author":"A.C. Yao","year":"1985","unstructured":"Yao, A.C.: On the complexity of maintaining partial sums. SIAM J. Comput. 14, 277\u2013288 (1985)","journal-title":"SIAM J. Comput."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9140-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-009-9140-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9140-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:36Z","timestamp":1559087256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-009-9140-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,20]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9140"],"URL":"https:\/\/doi.org\/10.1007\/s00454-009-9140-z","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,20]]}}}