Separator Based Parallel Divide and Conquer in Computational Geometry

An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on the use of sphere separators. Probability bounds are proved using the moment generating function technique.

• Type: Conference
• Year: 1992
• Where: SPAA
• Authors: Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
• Keywords: Distributed And Parallel Computing, K-nearest Neighbor Graph, Moment Generating Function, Processor Randomized Algorithm, SPAA 1992