On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Optimal parallel algorithms for polygon and point-set problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Maintenance of geometric extrema ∈
Journal of the ACM (JACM)
An Onlognloglogn algorithm for the on-line closest pair problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for the on-line closest-pair problem
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Parallel solutions to geometric problems in the scan model of computation
Journal of Computer and System Sciences
An optimal algorithm for closest pair maintenance (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
On enumerating and selecting distances
Proceedings of the fourteenth annual symposium on Computational geometry
Randomized data structures for the dynamic closest-pair problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
New techniques for computing order statistics in Euclidean space (extended abstract)
SCG '85 Proceedings of the first annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
Multidimensional divide-and-conquer
Communications of the ACM
Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Learning Separations by Boolean Combinations of Half-Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple randomized algorithms for closest pair problems
Nordic Journal of Computing
Approximate k -Closest-Pairs with Space Filling Curves
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Extreme Distances in Multicolored Point Sets
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
A general method for solving divide-and-conquer recurrences
ACM SIGACT News
An approximate algorithm for top-k closest pairs join query in large high dimensional data
Data & Knowledge Engineering
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry: Theory and Applications
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Highly scalable trip grouping for large-scale collective transportation systems
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms (TALG)
Access Control Friendly Query Verification for Outsourced Data Publishing
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Reversible Data Hiding in the VQ-Compressed Domain
IEICE - Transactions on Information and Systems
Engineering the divide-and-conquer closest pair algorithm
Journal of Computer Science and Technology
ACM SIGACT News
Algorithms and theory of computation handbook
Computational-geometry approach to digital image contour extraction
Transactions on computational science XIII
| Hi-index | 0.02 |
We investigate a divide-and-conquer technique in multidimensional space which decomposes a geometric problem on N points in k dimensions into two problems on N/2 points in k dimensions plus a single problem on N points in k−1 dimension. Special structure of the subproblems is exploited to obtain an algorithm for finding the two closest of N points in 0(N log N) time in any dimension. Related results are discussed, along with some conjectures and unsolved geometric problems.