Document Type

Conference Proceeding

Publication Date



Department of Computer Science


Under the word RAM model, we design three data structures that can be constructed in O(n√lg n) time over n points in an n×n grid. The first data structure is an O(n lg n)-word structure supporting orthogonal range reporting in O(lg lg n + k) time, where k denotes output size and is an arbitrarily small constant. The second is an O(n lg lg n)-word structure supporting orthogonal range successor in O(lg lg n) time, while the third is an O(n lg n)-word structure supporting sorted range reporting in O(lg lg n + k) time. The query times of these data structures are optimal when the space costs must be within O(n polylog n) words. Their exact space bounds match those of the best known results achieving the same query times, and the O(n√lg n) construction time beats the previous bounds on preprocessing. Previously, among 2d range search structures, only the orthogonal range counting structure of Chan and Pǎtraşcu (SODA 2010) and the linear space, O(lg n) query time structure for orthogonal range successor by Belazzougui and Puglisi (SODA 2016) can be built in the same O(n√lg n) time. Hence our work is the first that achieve the same preprocessing time for optimal orthogonal range reporting and range successor. We also apply our results to improve the construction time of text indexes.

Publisher's Statement

© Younan Gao, Meng He, and Yakov Nekrich. Publisher’s version of record:

Publication Title

Leibniz International Proceedings in Informatics, LIPIcs



Creative Commons License

Creative Commons Attribution 3.0 License
This work is licensed under a Creative Commons Attribution 3.0 License.


Publisher's PDF


To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.