Computational geometry: an introduction
Computational geometry: an introduction
A new universal class of hash functions and dynamic hashing in real time
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
BLASTING through the information theoretic barrier with FUSION TREES
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
An introduction to parallel algorithms
An introduction to parallel algorithms
Applications of the fusion tree method to computational geometry and searching
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
We present a simple randomized algorithm for finding the Closest Foreign Pair, in a set of n points in D-dimensional space, where D ≥ 2 is a fixed constant and the distances are measured in the L1 and the L∞ metric. The algorithm runs in O(nlogD-1 n/log log n) time with high probability for the L∞ metric and in O(n log2D-1-1 n/log log n) time with high probability for the L1 metric.