Consider a set of N records corresponding to points in k-dimensional space (k 2). This article introduces one new data structure which uses memory O(Nlog k - 1 N) for supporting orthogonal range queries with worst-case complexity O(log k - 1 N) and several modifications of this proposal for a dynamic environment. These results are especially useful when $k = 2$.
No takes yet. Share an insight, caveat, or question.
Dan E. Willard (1985) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: