Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. J.L. Bentley, Algorithms for Klee’s rectangle problem, Unpublished notes, Dept. of Computer Science, CMU, 1977.
2. R.A. Finkel and J.L. Bentley, Quad-trees; a data structure for retrieval on composite keys, Acta Informatica 4 1974 1–9.
3. M.L. Fredman and B. Weide, The complexity of computing the measure of U[ai,bi], Comm. ACM 21 1978 540–544.
4. S. S. Iyengar, N. S. V. Rao, R. L. Kashyap, and V. K. Vaishnavi, Multidimensional data structures: Review and outlook, Advances in Computers 27 1988 69–119.
5. V. Klee, Can the measure of S[ai, bi] be computed in less than O(n log n) steps?, Amer. Math. Monthly 84 1977 284–285.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献