Orthogonal range reporting
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen · 2010
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. While the 2-d version of the problem was completely characterized in the pointer machine model more than two decades ago, this is not the case in higher dimensions.