{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:15:12Z","timestamp":1725563712991},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_32","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"374-385","source":"Crossref","is-referenced-by-count":3,"title":["A Unified Approach to Approximate Proximity Searching"],"prefix":"10.1007","author":[{"given":"Sunil","family":"Arya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilherme D.","family":"da Fonseca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David M.","family":"Mount","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Arya, S., da Fonseca, G.D., Mount, D.M.: Tradeoffs in approximate range searching made simpler. In: Proc. 21st SIBGRAPI, pp. 237\u2013244 (2008)","DOI":"10.1109\/SIBGRAPI.2008.24"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Arya, S., Malamatos, T.: Linear-size approximate Voronoi diagrams. In: Proc. 13th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 147\u2013155 (2002)","DOI":"10.1145\/510008.510011"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: Space-efficient approximate Voronoi diagrams. In: Proc. 34th Ann. ACM Symp. Theory of Comput. (STOC), pp. 721\u2013730 (2002)","DOI":"10.1145\/509907.510011"},{"key":"32_CR4","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: Space-time tradeoffs for approximate spherical range counting. In: Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 535\u2013544 (2005)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: On the importance of idempotence. In: Proc. 38th ACM Symp. on Theory of Comput. (STOC), pp. 564\u2013573 (2006)","DOI":"10.1145\/1132516.1132598"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1613676.1613677","volume":"57","author":"S. Arya","year":"2009","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: Space-time tradeoffs for approximate nearest neighbor searching. J. ACM\u00a057, 1\u201354 (2009)","journal-title":"J. ACM"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0925-7721(00)00022-5","volume":"17","author":"S. Arya","year":"2001","unstructured":"Arya, S., Mount, D.M.: Approximate range searching. Comput. Geom.\u00a017, 135\u2013163 (2001)","journal-title":"Comput. Geom."},{"issue":"6","key":"32_CR8","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM\u00a045(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Bespamyatnikh, S.N.: Dynamic algorithms for approximate neighbor searching. In: Proc. 8th Canad. Conf. Comput. Geom. (CCCG), pp. 252\u2013257 (1996)","DOI":"10.1515\/9780773591134-044"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/PL00009390","volume":"20","author":"T.M. Chan","year":"1998","unstructured":"Chan, T.M.: Approximate nearest neighbor queries revisited. Discrete Comput. Geom.\u00a020, 359\u2013373 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR11","unstructured":"Chan, T.M.: Closest-point problems simplified on the ram. In: Proc. 13th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 472\u2013473 (2002)"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.comgeo.2005.10.002","volume":"35","author":"T.M. Chan","year":"2006","unstructured":"Chan, T.M.: Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom.\u00a035(1), 20\u201335 (2006)","journal-title":"Comput. Geom."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: An algorithm for approximate closest-point queries. In: Proc. 10th Annu. ACM Symp. Comput. Geom. (SoCG), pp. 160\u2013164 (1994)","DOI":"10.1145\/177424.177609"},{"issue":"4","key":"32_CR14","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.comgeo.2008.09.009","volume":"43","author":"G.D. Fonseca da","year":"2010","unstructured":"da Fonseca, G.D., Mount, D.M.: Approximate range searching: The absolute model. Comput. Geom.\u00a043(4), 434\u2013444 (2010)","journal-title":"Comput. Geom."},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1006\/jagm.2000.1135","volume":"38","author":"C.A. Duncan","year":"2001","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.: Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. J. Algorithms\u00a038, 303\u2013333 (2001)","journal-title":"J. Algorithms"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T., Sun, J.Z.: The skip quadtree: a simple dynamic data structure for multidimensional data. In: Proc. 21st ACM Symp. Comput. Geom. (SoCG), pp. 296\u2013305 (2005)","DOI":"10.1145\/1064092.1064138"},{"issue":"4","key":"32_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0218195905001750","volume":"15","author":"S. Funke","year":"2005","unstructured":"Funke, S., Malamatos, T., Ray, R.: Finding planar regions in a terrain: in practice and with a guarantee. Internat. J. Comput. Geom. Appl.\u00a015(4), 379\u2013401 (2005)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"32_CR18","unstructured":"Har-Peled, S.: Notes on geometric approximation algorithms, http:\/\/valis.cs.uiuc.edu\/~sariel\/teach\/notes\/aprx\/"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: A replacement for Voronoi diagrams of near linear size. In: Proc. 42nd Ann. Symp. Foundations of Computer Science (FOCS), pp. 94\u2013103 (2001)","DOI":"10.1109\/SFCS.2001.959884"},{"issue":"3","key":"32_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00453-004-1123-0","volume":"41","author":"S. Har-Peled","year":"2005","unstructured":"Har-Peled, S., Mazumdar, S.: Fast algorithms for comput. the smallest k-enclosing circle. Algorithmica\u00a041(3), 147\u2013157 (2005)","journal-title":"Algorithmica"},{"key":"32_CR21","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 cutting. Discrete Comput. Geom.\u00a010, 157\u2013182 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02573975","volume":"10","author":"J. Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J., Schwarzkopf, O.: On ray shooting in convex polytopes. Discrete Comput. Geom.\u00a010, 215\u2013232 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1016\/j.jcss.2006.01.007","volume":"72","author":"Y. Sabharwal","year":"2006","unstructured":"Sabharwal, Y., Sen, S., Sharma, N.: Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions. J. Comput. Sys. Sci.\u00a072, 955\u2013977 (2006)","journal-title":"J. Comput. Sys. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T00:54:34Z","timestamp":1711760074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}