The input/output complexity of sorting and related problems
Communications of the ACM
Multidimensional access methods
ACM Computing Surveys (CSUR)
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Multidimensional divide-and-conquer
Communications of the ACM
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Optimal Dynamic Range Searching in Non-replicating Index Structures
ICDT '99 Proceedings of the 7th International Conference on Database Theory
The priority R-tree: A practically efficient and worst-case optimal R-tree
ACM Transactions on Algorithms (TALG)
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Algorithms and Theory of Computation Handbook
Algorithms and Theory of Computation Handbook
Orthogonal Range Reporting in Three and Higher Dimensions
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Range reporting is a one of the most fundamental topics in spatial databases and computational geometry. In this class of problems, the input consists of a set of geometric objects, such as points, line segments, rectangles etc. The goal is to preprocess the input set into a data structure, such that given a query range, one can efficiently report all input objects intersecting the range. The ranges most commonly considered are axis-parallel rectangles, halfspaces, points, simplices and balls.