Divide-and-conquer in multidimensional space
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Lower bounds from complex function theory
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Given N points in K-space, the O(N2) distances between them may be characterized by their minimum[1, 2], maximum [3], mean[4, 5, 6], or median [7]; since these problems are geometrical, it may be Interesting to consider the geometric mean - or, which is equivalent, the product - of the distances between all pairs.