1. 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)
2. Basch, J., Guibas, L.J., Hershberger, J.: Data structures for mobile data. J. Algorithms 31, 1–19 (1999)
3. Basch, J., Guibas, L.J., Zhang, L.: Proximity problems on moving points. In: Proceedings of the 13th Annual Symposium on Computational Geometry (SoCG ’97), pp. 344–351. ACM, New York (1997)
4. Brönnimann, H., Goodrich, M.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(1), 463–479 (1995)
5. Chan, T.M., Rahmati, Z.: A Clustering-based approach to kinetic closest pair. In: Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT ’16), vol. 53, pp. 28:1–28:13. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl (2016)