Pyramid Computer Solutions of the Closest Pair Problem

@article{Stout1985PyramidCS,
  title={Pyramid Computer Solutions of the Closest Pair Problem},
  author={Quentin F. Stout},
  journal={J. Algorithms},
  year={1985},
  volume={6},
  pages={200-212}
}
Given an N x N array of OS and Is, 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 Is). 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… CONTINUE READING
7 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Broadcasting in mesh-connected computers, in “Proc

  • Q. F. STOUT
  • Conf. on Inform. Sci. Systems,” Princeton Univ.,
  • 1982
Highly Influential
4 Excerpts

SCHAEFER et uI., “A Pyramid of MPP Processing Elements,

  • D H.
  • Tech. report, George Mason Univ.,
  • 1984
1 Excerpt

Parallel Construction of Polygonal Boundaries from Given Vertices on a Raster,” Comput

  • B. SAKODA
  • Sci. Dept. Report CS81-21. Penn. State Univ.,
  • 1981

Towards hierarchical cellular logic: Design considerations for pyramid machines, Dept

  • S. L. TANIMOTO
  • of Comput. Sci. Tech. Report 81-02-01, Univ. of…
  • 1981
1 Excerpt

A

  • AN S.L. TANIMOTO
  • KLINGER, “Structured Computer Vision: Machine…
  • 1980

DYER, A fast parallel algorithm for the closest pair problem, Inform

  • C R.
  • Process. Lett
  • 1980
3 Excerpts

Cellular Pyramids for Image Analysis,” TR-544, Computer Science Center, Univ

  • C. R. DYER, A. ROSENFELD
  • of Maryland,
  • 1977
1 Excerpt

Similar Papers

Loading similar papers…