An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

José C. Pereira, Fernando G. Lobo. An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case. J. Comput. Sci. Technol., 27(4):891-896, 2012. [doi]

Abstract

Abstract is missing.