Fast all nearest neighbor algorithms from image processing perspective

In this paper, we solve the k-dimensional all nearest neighbor (kD/spl I.bar/ANN) problem, where k=2 or 3, on a linear array with a reconfigurable pipelined bus system (LARPBS) from image processing perspective. Three scalable O(1) time algorithms are proposed, one for solving the Euclidean distance transform (EDT) problem and the other two for solving the all nearest neighbor (ANN) problem. First, for a two-dimensional (2D) binary image of size N/spl times/N, we devise an algorithm for solving the 2D/spl I.bar/EDT problem using an LARPBS of size N/sup 2+/spl epsiv//, where 0