乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:36:01Z","timestamp":1725622561996},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993713","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"579-586","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate polytope membership queries"],"prefix":"10.1145","author":[{"given":"Sunil","family":"Arya","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong"}]},{"given":"Guilherme D.","family":"da Fonseca","sequence":"additional","affiliation":[{"name":"Universidade Federal do Estado do Rio de Janeiro (UNIRIO), Rio de Janeiro, Brazil"}]},{"given":"David M.","family":"Mount","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Combinatorial and Computational Geometry.","author":"Agarwal P. K.","year":"2005","unstructured":"P. K. Agarwal , S. Har-Peled , and K. R. Varadarajan . Geometric approximation via coresets . In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry. 2005 . P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Geometric approximation via coresets. In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry. 2005."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222051"},{"key":"e_1_3_2_2_3_1","first-page":"374","volume-title":"Proc. 18th Euro. Symp. Algorithms (ESA)","author":"Arya S.","year":"2010","unstructured":"S. Arya , G. D. da Fonseca , and D. M. Mount . A unifying approach to approximate proximity searching . In Proc. 18th Euro. Symp. Algorithms (ESA) , pages 374 -- 385 , 2010 . S. Arya, G. D. da Fonseca, and D. M. Mount. A unifying approach to approximate proximity searching. In Proc. 18th Euro. Symp. Algorithms (ESA), pages 374--385, 2010."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1613676.1613677"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00022-5"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/358315.358392"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009715923555"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509947"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/237218.237397"},{"key":"e_1_3_2_2_10_1","first-page":"472","volume-title":"Proc. 13th ACM-SIAM Symp. Discrete Algorithms (SODA)","author":"Chan T. M.","year":"2002","unstructured":"T. M. Chan . Closest-point problems simplified on the RAM . In Proc. 13th ACM-SIAM Symp. Discrete Algorithms (SODA) , pages 472 -- 473 , 2002 . T. M. Chan. Closest-point problems simplified on the RAM. In Proc. 13th ACM-SIAM Symp. Discrete Algorithms (SODA), pages 472--473, 2002."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.10.002"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810959.1810961"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645929.672705"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/177424.177609"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132564"},{"key":"e_1_3_2_2_16_1","volume-title":"Computational Geometry: Algorithms and Applications","author":"de Berg M.","year":"2010","unstructured":"M. de Berg , O. Cheong , M. van Kreveld , and M. Overmars . Computational Geometry: Algorithms and Applications . Springer , 3 rd edition, 2010 . M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer, 3rd edition, 2010.","edition":"3"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9045(74)90120-8"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1135"},{"key":"e_1_3_2_2_19_1","first-page":"327","volume-title":"Proc. 10th ACM-SIAM Symp. Discrete Algorithms (SODA)","author":"Erickson J.","year":"1999","unstructured":"J. Erickson , L. J. Guibas , J. Stolfi , and L. Zhang . Separation-sensitive collision detection for convex objects . In Proc. 10th ACM-SIAM Symp. Discrete Algorithms (SODA) , pages 327 -- 336 , 1999 . J. Erickson, L. J. Guibas, J. Stolfi, and L. Zhang. Separation-sensitive collision detection for convex objects. In Proc. 10th ACM-SIAM Symp. Discrete Algorithms (SODA), pages 327--336, 1999."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796588"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875592"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.7"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02573975"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90006-E"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1023"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004540010019"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00006-U"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/336154.336198"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.01.007"}],"event":{"name":"STOC'11: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Jose California USA","acronym":"STOC'11"},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993713","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T19:42:42Z","timestamp":1673120562000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":29,"alternative-id":["10.1145\/1993636.1993713","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993713","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}