Author:
Kothuri Ravi K.,Ravada Siva
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. W. M. Badaway and W. Aref. On local heuristics to speed up polygon-polygon intersection tests. In Proceedings of ACM GIS International Conference, pages 97–102, 1999.
2. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R* tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322–331, 1990.
3. S. Berchtold, D. A. Keim, and H. P. Kreigel. The X-tree: An index structure for high dimensional data. Proc of the Int. Conf. on Very Large Data Bases, 1996.
4. Lect Notes Comput Sci;T. Brinkhoff,1993
5. T. Brinkhoff, H. P. Kriegel, and R. Schneider. Comparison of approximations of complex objects in spatial database systems. In Proc. Int. Conf. on Data Engineering, pages 40–49, 1993.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献