Affiliation:
1. Johns Hopkins University, Baltimore, Maryland
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference31 articles.
1. N-body simulations of galaxy ~clustering. I. Initial conditions and galaxy collapse times;~AARSETH S. J.;Astrophys. J.,1979
2. A simple parallel tree contraction algorithm
3. ~ABRAMSON N. 1963. Information Theory and Coding. McGraw-Hill New York. ~ABRAMSON N. 1963. Information Theory and Coding. McGraw-Hill New York.
4. Euclidean minimum spanning trees and bichromatic closest pairs
5. ~AGARWAL P. K. AND MATOU~EK J. 1992. Relative neighborhood graphs in three dimensions. In ~Proceedings of the 3rd Annual Sympostum on Discrete Algorithms. ACM-SIAM New York and ~Philadelphia pp. 58-65. ~AGARWAL P. K. AND MATOU~EK J. 1992. Relative neighborhood graphs in three dimensions. In ~Proceedings of the 3rd Annual Sympostum on Discrete Algorithms. ACM-SIAM New York and ~Philadelphia pp. 58-65.
Cited by
321 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献