1. J.L. Bentley, M.I. Shamos, Divide-and-conquer in multidimensional space, in: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976, pp. 220–230.
2. Introduction to Algorithms;Cormen,2009
3. O. Daescu, K.Y. Teo, 2D closest pair problem: a closer look, in: Proceedings of the 29th Annual Canadian Conference on Computational Geometry, 2017, pp. 185–190.
4. A simple yet fast algorithm for the closest-pair problem using sorted projections on multi-dimensions;Dalkılıç;Inf. Sci. Syst.,2013
5. An improved algorithm for finding the closest pair of points;Ge;J. Comput. Sci. Tech.,2006