{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:22:13Z","timestamp":1760440933418,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,13]]},"DOI":"10.1145\/1810959.1811002","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"247-256","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A dynamic data structure for approximate range searching"],"prefix":"10.1145","author":[{"given":"David M.","family":"Mount","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Eunhui","family":"Park","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0967"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1993.253111"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00022-5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90222-U"},{"key":"e_1_3_2_1_6_1","first-page":"252","volume-title":"Proc. Eighth Canad. Conf. Comput. Geom.","author":"Bespamyatnikh S. N.","year":"1996","unstructured":"S. N. Bespamyatnikh . Dynamic algorithms for approximate neighbor searching . In Proc. Eighth Canad. Conf. Comput. Geom. , pages 252 -- 257 , 1996 . S. N. Bespamyatnikh. Dynamic algorithms for approximate neighbor searching. In Proc. Eighth Canad. Conf. Comput. Geom., pages 252--257, 1996."},{"key":"e_1_3_2_1_7_1","volume-title":"A minimalist's implementation of an approximate nearest neighbor algorithm in fixed dimensions. (See http:\/\/www.cs.uwaterloo.ca\/~tmchan\/pub.html)","author":"Chan T.","year":"2006","unstructured":"T. Chan . A minimalist's implementation of an approximate nearest neighbor algorithm in fixed dimensions. (See http:\/\/www.cs.uwaterloo.ca\/~tmchan\/pub.html) , 2006 . T. Chan. A minimalist's implementation of an approximate nearest neighbor algorithm in fixed dimensions. (See http:\/\/www.cs.uwaterloo.ca\/~tmchan\/pub.html), 2006."},{"key":"e_1_3_2_1_8_1","first-page":"472","volume-title":"Proc. 13th Annu. ACM-SIAM Sympos. Discrete Algorithms","author":"Chan T. M.","year":"2002","unstructured":"T. M. Chan . Closest-point problems simplified on the RAM . In Proc. 13th Annu. ACM-SIAM Sympos. Discrete Algorithms , pages 472 -- 473 , 2002 . T. M. Chan. Closest-point problems simplified on the RAM. In Proc. 13th Annu. ACM-SIAM Sympos. Discrete Algorithms, pages 472--473, 2002."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.16"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762121"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"de Berg M.","year":"2008","unstructured":"M. de Berg , M. van Kreveld , M. Overmars , and O. Schwarzkopf . Computational Geometry: Algorithms and Applications . Springer-Verlag , Berlin, Germany , 3 rd edition, 2008 . M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 3rd edition, 2008.","edition":"3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1135"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195908002568"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/358728.358741"},{"key":"e_1_3_2_1_16_1","volume-title":"Notes on geometric approximation algorithms. (http:\/\/valis.cs.uiuc.edu\/~sariel\/-teach\/notes\/aprx\/)","author":"Har-Peled S.","year":"2009","unstructured":"S. Har-Peled . Notes on geometric approximation algorithms. (http:\/\/valis.cs.uiuc.edu\/~sariel\/-teach\/notes\/aprx\/) , 2009 . S. Har-Peled. Notes on geometric approximation algorithms. (http:\/\/valis.cs.uiuc.edu\/~sariel\/-teach\/notes\/aprx\/), 2009."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_2_1_18_1","volume-title":"Morgan-Kaufmann","author":"Samet H.","year":"2006","unstructured":"H. Samet . Foundations of Multidimensional and Metric Data Structures . Morgan-Kaufmann , San Francisco , 2006 . H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, 2006."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940876"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"}],"event":{"name":"SoCG '10: Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Snowbird Utah USA","acronym":"SoCG '10"},"container-title":["Proceedings of the twenty-sixth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1811002","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810959.1811002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:01Z","timestamp":1750245781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1811002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":19,"alternative-id":["10.1145\/1810959.1811002","10.1145\/1810959"],"URL":"https:\/\/doi.org\/10.1145\/1810959.1811002","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}