Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
Top-k document retrieval in optimal time and linear space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Optimal succinctness for range minimum queries
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Range aggregate maximal points in the plane
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.89 |
In this work, we consider the problem of finding the closest pair (in L"1 metric) of points in an orthogonal query rectangle. Given a set of n static points on a UxU grid, we preprocess these points into a data structure of size O(mf(m)log^2m) that can be queried in time O((g(m)+loglogm)log^3m), for m=O(nlogU) and (i) f(m)=O(1) and g(m)=O(log^@em); (ii) f(m)=O(loglogm) and g(m)=O(loglogm); (iii) f(m)=O(log^@em) and g(m)=O(1). Here @e: 0