Filtering search: a new approach to query answering
SIAM Journal on Computing
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
Intersection queries in curved objects
Journal of Algorithms
Efficient algorithms for generalized intersection searching on non-iso-oriented objects
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Lower bounds for intersection searching and fractional cascading in higher dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Range Searching in Categorical Data: Colored Range Searching on Grid
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Hi-index | 0.89 |
We develop efficient algorithms for a number of generalized intersection reporting problems, including orthogonal and general segment intersection, 2D range searching, rectangular point enclosure, and rectangle intersection search. Our results for orthogonal and general segment intersection, 3-sided 2D range searching, and rectangular pointer enclosure problems match the lower bounds for their corresponding standard versions under the pointer machine model. Our results for the remaining problems improve upon the best known previous algorithms.