Thumbnail
Access Restriction
Subscribed

Author Callahan, Paul B. ♦ Kosaraju, S. Rao
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1995
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword All nearest neighbors ♦ Fast multipole method
Abstract We define the notion of a well-separated pair decomposition of points in $\textit{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 $\textit{k}-nearest$ neighbors and $\textit{n}-body$ potential fields.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1995-01-03
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 42
Issue Number 1
Page Count 24
Starting Page 67
Ending Page 90


Open content in new tab

   Open content in new tab
Source: ACM Digital Library