Sorted Range Reporting
Data Structures and Algorithms
2012-04-26 v2 Computational Geometry
Abstract
In this paper we consider a variant of the orthogonal range reporting problem when all points should be reported in the sorted order of their -coordinates. We show that reporting two-dimensional points with this additional condition can be organized (almost) as efficiently as the standard range reporting. Moreover, our results generalize and improve the previously known results for the orthogonal range successor problem and can be used to obtain better solutions for some stringology problems.
Keywords
Cite
@article{arxiv.1204.4509,
title = {Sorted Range Reporting},
author = {Yakov Nekrich and Gonzalo Navarro},
journal= {arXiv preprint arXiv:1204.4509},
year = {2012}
}