We define the notion of a well-separated pair decomposition of points in d-dimensional space. We 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.
No takes yet. Share an insight, caveat, or question.
Callahan et al. (1992) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: