Sciweavers

SPAA
1992
ACM

Separator Based Parallel Divide and Conquer in Computational Geometry

14 years 2 months ago
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.
Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
Added 11 Aug 2010
Updated 11 Aug 2010
Type Conference
Year 1992
Where SPAA
Authors Alan M. Frieze, Gary L. Miller, Shang-Hua Teng
Comments (0)