{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:05:31Z","timestamp":1725552331536},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_42","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T07:54:59Z","timestamp":1272354899000},"page":"501-512","source":"Crossref","is-referenced-by-count":1,"title":["Practical Nearest Neighbor Search in the Plane"],"prefix":"10.1007","author":[{"given":"Michael","family":"Connor","sequence":"first","affiliation":[]},{"given":"Piyush","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Arya, S., Mount, D.: Computational geometry: Proximity and location. In: Mehta, D., Sahni, S. (eds.) Handbook of Data Structures and Applications, ch. 3, pp. 63\u20131, 63\u201322. CRC Press, Boca Raton (2005)","DOI":"10.1201\/9781420035179.ch63"},{"key":"42_CR2","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.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM\u00a045, 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Birn, M., Holtgrewe, M., Sanders, P., Singler, J.: Simple and Fast Nearest Neighbor Search. In: 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, January 16, pp. 43\u201354 (2010)","DOI":"10.1137\/1.9781611972900.5"},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/336154.336165","volume-title":"SCG 2000: Proceedings of the sixteenth annual symposium on Computational geometry","author":"J.-D. Boissonnat","year":"2000","unstructured":"Boissonnat, J.-D., Devillers, O., Teillaud, M., Yvinec, M.: Triangulations in cgal (extended abstract). In: SCG 2000: Proceedings of the sixteenth annual symposium on Computational geometry, pp. 11\u201318. ACM, New York (2000)"},{"key":"42_CR5","unstructured":"Chan, T.M.: Closest-point problems simplified on the ram. In: SODA 2002: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 472\u2013473. Society for Industrial and Applied Mathematics, Philadelphia (2002)"},{"key":"42_CR6","unstructured":"Chan, T.M.: Manuscript: A minimalist\u2019s implementation of an approximate nearest neighbor algorithm in fixed dimensions (2006)"},{"key":"42_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.7551\/mitpress\/4908.003.0005","volume-title":"Nearest-Neighbor Methods for Learning and Vision: Theory and Practice","author":"K.L. Clarkson","year":"2006","unstructured":"Clarkson, K.L.: Nearest-neighbor searching and metric space dimensions. In: Shakhnarovich, G., Darrell, T., Indyk, P. (eds.) Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pp. 15\u201359. MIT Press, Cambridge (2006)"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Connor, M., Kumar, P.: Fast construction of k-nearest neighbor graphs for point clouds. IEEE Transactions on Visualization and Computer Graphics\u00a099 (PrePrints) (2010)","DOI":"10.1109\/TVCG.2010.9"},{"key":"42_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/S0129054102001035","volume":"13","author":"O. Devillers","year":"2002","unstructured":"Devillers, O.: The Delaunay Hierarchy. International Journal of Foundations of Computer Science\u00a013, 163\u2013180 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/1064092.1064138","volume-title":"Proc. of the twenty-first annual symposium on Computational geometry","author":"D. Eppstein","year":"2005","unstructured":"Eppstein, D., Goodrich, M.T., Sun, J.Z.: The skip quadtree: a simple dynamic data structure for multidimensional data. In: Proc. of the twenty-first annual symposium on Computational geometry, pp. 296\u2013305. ACM Press, New York (2005)"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/509907.510013","volume-title":"STOC 2002: Proceedings of the thirty-fourth annual ACM symposium on Theory of computing","author":"D.R. Karger","year":"2002","unstructured":"Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: STOC 2002: Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pp. 741\u2013750. ACM, New York (2002)"},{"issue":"1","key":"42_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D.G. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM Journal on Computing\u00a012(1), 28\u201335 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"42_CR14","unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. of 11th Canadian Conference on Computational Geometry, pp. 51\u201354 (1999)"},{"issue":"1","key":"42_CR15","first-page":"60","volume":"1","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The small world problem. Psychology Today\u00a01(1), 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"42_CR16","unstructured":"Mount, D.: ANN: Library for Approximate Nearest Neighbor Searching (1998), http:\/\/www.cs.umd.edu\/~mount\/ANN\/"},{"key":"42_CR17","volume-title":"Applications of spatial data structures: Computer graphics, image processing, and GIS","author":"H. Samet","year":"1990","unstructured":"Samet, H.: Applications of spatial data structures: Computer graphics, image processing, and GIS. Addison-Wesley Longman Publishing Co., Inc., Boston (1990)"},{"key":"42_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0014497","volume-title":"Applied Computational Geometry. Towards Geometric Engineering","author":"J.R. Shewchuk","year":"1996","unstructured":"Shewchuk, J.R.: Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In: Lin, M.C., Manocha, D. (eds.) FCRC-WS 1996 and WACG 1996. LNCS, vol.\u00a01148, pp. 203\u2013222. Springer, Heidelberg (1996); From the First ACM Workshop on Applied Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T23:05:26Z","timestamp":1711407926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}