Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines

Authors:
Qingmin Shi;Joseph JaJa
Affiliations:
Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA;Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA
Venue:
Information Processing Letters
Year:
2005

Citing 9
Cited 3

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
Further results on generalized intersection searching problems: counting, reporting, and dynamization

Journal of Algorithms
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

Isosurface Extraction and Spatial Filtering using Persistent Octree (POT)

IEEE Transactions on Visualization and Computer Graphics
Colored range searching on internal memory

DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II
Efficient range searching for categorical and plain data

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.