We consider a variant of the orthogonal range reporting problem when all points should be reported in the sorted order of their x-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. © 2012 Springer-Verlag.
CITATION STYLE
Nekrich, Y., & Navarro, G. (2012). Sorted range reporting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7357 LNCS, pp. 271–282). https://doi.org/10.1007/978-3-642-31155-0_24
Mendeley helps you to discover research relevant for your work.