Filtering search: a new approach to query answering
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Algorithms for generalized halfspace range searching and other intersection searching problems
Computational Geometry: Theory and Applications
A technique for adding range restrictions to generalized searching problems
Information Processing Letters
Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
New Upper Bounds for Generalized Intersection Searching Problems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Range Searching in Categorical Data: Colored Range Searching on Grid
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
| Hi-index | 0.00 |
Let S be a set of geometric objects that are aggregated into disjoint groups. The problem considered is that of preprocessing S so that for any query object, q, the distinct groups such that no objects from those groups are intersected by q can be reported efficiently. The goal is to devise solutions where the query time is sensitive to the output size, i.e., the number of groups reported. Unfortunately, the obvious approaches of (i) solving the corresponding intersection problem for aggregated data and reporting the complement, or (ii) querying with the complement of q are either expensive or incorrect. Efficient, output-sensitive solutions are given to several non-intersection searching problems on aggregated data, using methods such as geometric duality, sparsification, persistence, filtering search, and pruning.