Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Callahan et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: