A simple randomized sieve algorithm for the closest-pair problem

Abstract

We present a linear time randomized sieve algorithm for the closest-pair problem. The algorithm and its analysis are simple. The algorithm is extended to obtain a randomized linear time approximation algorithm for the closest bichromatic pair problem. © 1995 Academic Press, Inc.