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


We present an engineered version of the divide-and-conquer algorithm for finding the closest pair of points, within a given set of points in the XY-plane. For this version of the algorithm we show that only two pairwise comparisons are required in the combine step, for each point that lies in the 2δ-wide vertical slab. The correctness of the algorithm is… (More)
DOI: 10.1007/s11390-012-1272-6


9 Figures and Tables

Slides referencing similar topics