Author:
Lai Ying Kit,Poon Chung Keung,Shi Benyun
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference23 articles.
1. P.K. Agarwal, S. Govindarajan, S. Muthukrishnan, Range searching in categorical data: colored range searching on grid, in: 10th European Symposium on Algorithms, 2002, pp. 17–28
2. Symmetric binary B-trees: Data structures and maintenance algorithms;Bayer;Acta Inform.,1972
3. N. Beckmann, H.P. Kriegel, R. Schnieder, B. Seeger, The R*-tree: An efficient and robust access method for points and rectangles, in: ACM SIGMOD Conference on the Management of Data, 1990, pp. 322–331
4. J.L. Bentley, Algorithms for Klee's rectangle problems, Department of Computer Science, Carnegie Mellon Univ., unpublished notes, 1977
5. Multidimensional divide-and-conquer;Bentley;Comm. ACM,1980
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献