A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors And N-Body Potential Fields

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. © 1995, ACM. All rights reserved.