Four-dimensional dominance range reporting in linear space

Document Type

Conference Proceeding

Publication Date



Department of Computer Science


In this paper we study the four-dimensional dominance range reporting problem and present data structures with linear or almost-linear space usage. Our results can be also used to answer four-dimensional queries that are bounded on five sides. The first data structure presented in this paper uses linear space and answers queries in O(log1+ε n + k logε n) time, where k is the number of reported points, n is the number of points in the data structure, and ε is an arbitrarily small positive constant. Our second data structure uses O(n logε n) space and answers queries in O(log n + k) time. These are the first data structures for this problem that use linear (resp. O(n logε n)) space and answer queries in poly-logarithmic time. For comparison the fastest previously known linear-space or O(n logε n)-space data structure supports queries in O(nε + k) time (Bentley and Mauer, 1980). Our results can be generalized to d ≥ 4 dimensions. For example, we can answer d-dimensional dominance range reporting queries in O(log log n(log n/ log log n)d−3 + k) time using O(n logd−4+ε n) space. Compared to the fastest previously known result (Chan, 2013), our data structure reduces the space usage by O(log n) without increasing the query time.

Publisher's Statement

© Yakov Nekrich; licensed under Creative Commons License CC-BY 36th International Symposium on Computational Geometry (SoCG 2020).

Publication Title

Leibniz International Proceedings in Informatics, LIPIcs