Author:
Hu Xiaocheng,Tao Yufei,Yang Yi,Zhou Shuigeng
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference11 articles.
1. Alon, N., Schieber, B.: Optimal preprocessing for answeringon-line product queries. Technical Report TR 71/87, Tel-AvivUniversity (1987)
2. Arya, S., Mount, D.M., Xia, J.: Tight lower bounds for halfspace range searching. Discrete Comput. Geom. 47(4), 711–730 (2012)
3. Chan, T.M.: Optimal partition trees. Discrete Comput. Geom. 47(4), 661–690 (2012)
4. Chazelle, B.: Lower bounds for orthogonal range searching II. The arithmetic model. JACM 37(3), 439–463 (1990)
5. Fredman, M.L.: A lower bound on the complexity of orthogonal range queries. JACM 28(4), 696–705 (1981)