Abstract
We develop several linear or near-linear space and I/O-efficient dynamic data structures for orthogonal range-max queries and stabbing-max queries. Given a set of N weighted points in ℝd, the range-max problem asks for the maximum-weight point in a query hyperrectangle. In the dual stabbing-max problem, we are given N weighted hyper-rectangles, and we wish to find the maximum-weight rectangle containing a query point. Our structures improve on previous structures in several important ways. © Springer-Verlag 2003.
Cite
CITATION STYLE
Agarwal, P. K., Arge, L., Yang, J., & Yi, K. (2003). I/O-efficient structures for orthogonal range-max and stabbing-max queries. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2832, 7–18. https://doi.org/10.1007/978-3-540-39658-1_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
