Pyramid Computer Solutions of the Closest Pair Problem

Given an N × N array of 0s and 1s, the closest pair problem is to determine the minimum distance between any pair of ones. Let D be this minimum distance (or D = 2N if there are fewer than two 1s). Two solutions to this problem are given, one requiring O(log(N) + D) time and the other O(log(N)). These solutions are for two types of parallel computers arranged in a pyramid fashion with the base of the pyramid containing the matrix. The results improve upon an algorithm of Dyer that requires O(N) time on a more powerful computer.

[1]  Joseph F. Traub,et al.  Algorithms and Complexity: New Directions and Recent Results , 1976 .

[2]  Azriel Rosenfeld,et al.  Cellular Pyramids for Image Analysis. , 1977 .

[3]  Quentin F. Stout,et al.  BROADCASTING IN MESH-CONNECTED COMPUTERS. , 1982 .

[4]  Gideon Yuval,et al.  Finding Nearest Neighbors , 1976, Inf. Process. Lett..

[5]  Russ Miller,et al.  Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Michael Ian Shamos,et al.  Divide-and-conquer in multidimensional space , 1976, STOC '76.

[7]  Michael Ian Shamos,et al.  Geometric complexity , 1975, STOC.

[8]  Karl N. Levitt,et al.  Cellular arrays for the solution of graph problems , 1972, Commun. ACM.

[9]  John E. Hopcroft,et al.  A Note on Rabin's Nearest-Neighbor Algorithm , 1978, Inf. Process. Lett..

[10]  Quentin F. Stout.  Drawing Straight Lines with a Pyramid Cellular Automaton , 1982, Inf. Process. Lett..

[11]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[12]  Charles R. Dyer,et al.  A Fast Parallel Algorithm for the Closest Pair Problem , 1980, Inf. Process. Lett..

[13]  Leonard Uhr,et al.  Layered "Recognition Cone" Networks That Preprocess, Classify, and Describe , 1972, IEEE Transactions on Computers.

[14]  S. Tanimoto,et al.  Structured computer vision: Machine perception through hierarchical computation structures , 1980 .

[15]  Stephen N. Cole.  Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Trans. Computers.

[16]  E. F. Moore.  Machine Models of Self-Reproduction , 1962 .