A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

  • Authors:
  • Paul B. Callahan;S. Rao Kosaraju

  • Affiliations:
  • Johns Hopkins University, Baltimore, Maryland;Johns Hopkins University, Baltimore, Maryland

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1995

Quantified Score

Hi-index 0.01

Visualization

Abstract

We define the notion of a well-separated pair decomposition of points in d-dimensional space. We then develop efficient sequential and parallel algorithms for computing such a decomposition. We apply the resulting decomposition to the efficient computation of k-nearest neighbors and n-body potential fields.