Optimal algorithms for computing the minimum distance between two finite planar sets

Abstract

It is shown in this paper that the minimum distance between two finite planar sets of n points can be computer in O( n log n) worst-case running time and that this is optimal to within a constant factor. Furthermore, when the sets form a convex polygon this complexity can be reduced O( n).