Los puntos clave no están disponibles para este artículo en este momento.
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.
Callahan et al. (Tue,) studied this question.