{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T16:16:12Z","timestamp":1794500172408,"version":"4.9.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319193144","type":"print"},{"value":"9783319193151","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19315-1_27","type":"book-chapter","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T06:42:08Z","timestamp":1433572928000},"page":"307-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Kinetic Reverse k-Nearest Neighbor Problem"],"prefix":"10.1007","author":[{"given":"Zahed","family":"Rahmati","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valerie","family":"King","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,6,7]]},"reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s00454-011-9343-y","volume":"45","author":"MA Abam","year":"2011","unstructured":"Abam, M.A., de Berg, M.: Kinetic spanners in $$\\mathbb{R}^d$$. Discrete Comput. Geom. 45(4), 723\u2013736 (2011)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"27_CR2","first-page":"1","volume":"5","author":"PK Agarwal","year":"2008","unstructured":"Agarwal, P.K., Kaplan, H., Sharir, M.: Kinetic and dynamic data structures for closest pair and all nearest neighbors. ACM Trans. Algorithms 5(4), 1\u201337 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"27_CR3","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 in fixed dimensions. J. ACM 45(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"27_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer-Verlag TELOS, Santa Clara (2008)","edition":"3"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"PB Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to $$k$$-nearest-neighbors and $$n$$-body potential fields. J. ACM 42(1), 67\u201390 (1995)","journal-title":"J. ACM"},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s00454-005-1165-3","volume":"34","author":"TM Chan","year":"2005","unstructured":"Chan, T.M.: On levels in arrangements of curves, ii: A simple inequality and its consequences. Discrete Comput. Geom. 34(1), 11\u201324 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: On levels in arrangements of curves, iii: further improvements. In: Proceedings of the 24th annual Symposium on Computational Geometry (SoCG 2008), pp. 85\u201393. ACM, New York (2008)","DOI":"10.1145\/1377676.1377691"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00778-011-0235-9","volume":"21","author":"MA Cheema","year":"2012","unstructured":"Cheema, M.A., Zhang, W., Lin, X., Zhang, Y., Li, X.: Continuous reverse k nearest neighbors queries in euclidean space and in spatial networks. VLDB J. 21(1), 69\u201395 (2012)","journal-title":"VLDB J."},{"issue":"02","key":"27_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1142\/S0218195911003603","volume":"21","author":"O Cheong","year":"2011","unstructured":"Cheong, O., Vigneron, A., Yon, J.: Reverse nearest neighbor queries in fixed dimension. Int. J. Comput. Geom. Appl. 21(02), 179\u2013188 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Fast algorithms for the all nearest neighbors problem. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science (FOCS 1983), pp. 226\u2013232. IEEE Computer Society, Washington, DC (1983)","DOI":"10.1109\/SFCS.1983.16"},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TVCG.2010.9","volume":"16","author":"M Connor","year":"2010","unstructured":"Connor, M., Kumar, P.: Fast construction of $$k$$-nearest neighbor graphs for point clouds. IEEE Trans. Vis. Comput. Graph. 16(4), 599\u2013608 (2010)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"5","key":"27_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0925-7721(95)00009-7","volume":"5","author":"MT Dickerson","year":"1996","unstructured":"Dickerson, M.T., Eppstein, D.: Algorithms for proximity problems in higher dimensions. Int. J. Comput. Geom. Appl. 5(5), 277\u2013291 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (SIGMOD 2000), pp. 201\u2013212. ACM, New York (2000)","DOI":"10.1145\/342009.335415"},{"key":"27_CR14","unstructured":"Maheshwari, A., Vahrenhold, J., Zeh, N.: On reverse nearest neighbor queries. In: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG 2002), pp. 128\u2013132 (2002)"},{"key":"27_CR15","unstructured":"Rahmati, Z.: Simple, faster kinetic data structures. Ph.D. thesis, University of Victoria (2014). http:\/\/zahedrahmati.com"},{"key":"27_CR16","unstructured":"Rahmati, Z., Abam, M.A., King, V., Whitesides, S.: Kinetic data structures for the Semi-Yao graph and all nearest neighbors in $$\\mathbb{R}^d$$. In: Proceedings of the 26th Canadian Conference on Computational Geometry (CCCG 2014) (2014)"},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.comgeo.2014.12.002","volume":"48","author":"Z Rahmati","year":"2015","unstructured":"Rahmati, Z., Abam, M.A., King, V., Whitesides, S., Zarei, A.: A simple, faster method for kinetic proximity problems. Comput. Geom. 48(4), 342\u2013359 (2015)","journal-title":"Comput. Geom."},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"PM Vaidya","year":"1989","unstructured":"Vaidya, P.M.: An O($$n\\log n$$) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom. 4(2), 101\u2013115 (1989)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19315-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T04:55:31Z","timestamp":1676436931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19315-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319193144","9783319193151"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1_27","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-19315-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"7 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}