SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Filtering search: A new approach to query-answering
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
The power of geometric duality
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On the shape of a set of points in the plane
IEEE Transactions on Information Theory
Solving query-retrieval problems by compacting Voronoi diagrams
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Let P be a set of n points in the Euclidean plane and let C be a convex figure. We study the problem of preprocessing P so that for any query point q, the points of P in C+q can be retrieved efficiently. If constant time sumces for deciding the inclusion of a point in C, we then demonstrate the existence of an optimal solution: the algorithm requires O(n) space and O(k + log n) time for a query with output size k. If C is a disk, the problem becomes the wellknown fixed-radius neighbour problem, to which we thus provide the first known optimal solution.