Sciweavers

7 search results - page 1 / 2
» spaa 1992
Sort
View
SPAA
1992
ACM
13 years 9 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 t...
Alan M. Frieze, Gary L. Miller, Shang-Hua Teng