{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:07Z","timestamp":1725603667906},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_8","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"82-92","source":"Crossref","is-referenced-by-count":0,"title":["Can Nearest Neighbor Searching Be Simple and Always Fast?"],"prefix":"10.1007","author":[{"given":"Victor","family":"Alvarez","sequence":"first","affiliation":[]},{"given":"David G.","family":"Kirkpatrick","sequence":"additional","affiliation":[]},{"given":"Raimund","family":"Seidel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"8_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional Binary Search Trees used for Associative Searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"key":"8_CR2","volume-title":"Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"M. Birn","year":"2010","unstructured":"Birn, M., Holtgrewe, M., Sanders, P., Singler, J.: Simple and Fast Nearest Neighbor Search. In: Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia (2010)"},{"doi-asserted-by":"crossref","unstructured":"Canny, J.F., Donald, B.R., Ressler, E.K.: A Rational Rotation Method for Robust Geometric Algorithms. In: Proc. of the Eigth ACM Symposium on Computational Geometry (SOCG), pp. 251\u2013260 (1992)","key":"8_CR3","DOI":"10.1145\/142675.142726"},{"issue":"1","key":"8_CR4","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 J. Comput.\u00a012(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539796305365","volume":"28","author":"G. Liotta","year":"1998","unstructured":"Liotta, G., Preparata, F.P., Tamassia, R.: Robust Proximity Queries: An Illustration of Degree-driven Algorithm Design. SIAM J. Comput.\u00a028(3), 864\u2013889 (1998)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R.J. Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a Planar Separator Theorem. SIAM J. Comput.\u00a09(3), 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Millman, D., Snoeyink, J.: Computing Planar Voronoi Diagrams in Double Precision: A Further Example of Degree-driven Algorithm Design. In: Proceedings of the Annual Symposium on Computational Geometry (SoCG), pp. 386\u2013392 (2010)","key":"8_CR7","DOI":"10.1145\/1810959.1811024"},{"unstructured":"Mount, D.M., Arya, S.: ANN: A Library for Approximate Nearest Neighbor Searching. In: CGC 2nd Annual Fall Workshop on Computational Geometry (1997)","key":"8_CR8"},{"doi-asserted-by":"crossref","unstructured":"Shamos, M. I.: Geometric Complexity. In: Proceedings of Seventh Annual ACM Symposium on Theory of Computing (STOC), pp. 224\u2013233 (1975)","key":"8_CR9","DOI":"10.1145\/800116.803772"},{"key":"8_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G.M. Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T15:47:10Z","timestamp":1554133630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}