Optimal parallel all-nearest-neighbors using the well-separated pair decomposition
Paul B. Callahan · 2002
We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in R/sup d/. We show how this leads to a deterministic optimal O(log n) time parallel algorithm for finding the k nearest neighbors of each point in P, where k is a constant. We discuss several additional applications of the well-separated pair decomposition for which we can derive faster parallel algorithms.>