Sorted range reporting. (English) Zbl 1347.68343

Fomin, Fedor V. (ed.) et al., Algorithm theory – SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4–6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 271-282 (2012).
Summary: 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.
For the entire collection see [Zbl 1243.68018].


68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
68P05 Data structures
68W32 Algorithms on strings
Full Text: DOI arXiv