International Workshop on Combinatorial Algorithms

IWOCA 2014: Combinatorial Algorithms pp 307-317 | Cite as

Kinetic Reverse k-Nearest Neighbor Problem

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8986)

Abstract

This paper provides the first solution to the kinetic reverse k-nearest neighbor (R\(k\)NN) problem in \(\mathbb {R}^d\), which is defined as follows: Given a set P of n moving points in arbitrary but fixed dimension d, an integer k, and a query point \(q\notin P\) at any time t, report all the points \(p\in P\) for which q is one of the k-nearest neighbors of p.

Keywords

Reverse k-nearest neighbor query Moving points k-nearest neighbors Kinetic data structure Continuous monitoring Continuous queries 

Notes

Acknowledgments

We thank Timothy M. Chan for his helpful comments and suggestions.

References

  1. 1.
    Abam, M.A., de Berg, M.: Kinetic spanners in \(\mathbb{R}^d\). Discrete Comput. Geom. 45(4), 723–736 (2011)MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    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–37 (2008)MathSciNetGoogle Scholar
  3. 3.
    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–923 (1998)MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer-Verlag TELOS, Santa Clara (2008)CrossRefGoogle Scholar
  5. 5.
    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–90 (1995)MATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Chan, T.M.: On levels in arrangements of curves, ii: A simple inequality and its consequences. Discrete Comput. Geom. 34(1), 11–24 (2005)MATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    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–93. ACM, New York (2008)Google Scholar
  8. 8.
    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–95 (2012)CrossRefGoogle Scholar
  9. 9.
    Cheong, O., Vigneron, A., Yon, J.: Reverse nearest neighbor queries in fixed dimension. Int. J. Comput. Geom. Appl. 21(02), 179–188 (2011)MATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    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–232. IEEE Computer Society, Washington, DC (1983)Google Scholar
  11. 11.
    Connor, M., Kumar, P.: Fast construction of \(k\)-nearest neighbor graphs for point clouds. IEEE Trans. Vis. Comput. Graph. 16(4), 599–608 (2010)CrossRefGoogle Scholar
  12. 12.
    Dickerson, M.T., Eppstein, D.: Algorithms for proximity problems in higher dimensions. Int. J. Comput. Geom. Appl. 5(5), 277–291 (1996)MATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    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–212. ACM, New York (2000)Google Scholar
  14. 14.
    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–132 (2002)Google Scholar
  15. 15.
    Rahmati, Z.: Simple, faster kinetic data structures. Ph.D. thesis, University of Victoria (2014). http://zahedrahmati.com
  16. 16.
    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)Google Scholar
  17. 17.
    Rahmati, Z., Abam, M.A., King, V., Whitesides, S., Zarei, A.: A simple, faster method for kinetic proximity problems. Comput. Geom. 48(4), 342–359 (2015)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Vaidya, P.M.: An O(\(n\log n\)) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom. 4(2), 101–115 (1989)MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of VictoriaVictoriaCanada
  2. 2.Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations