Author:
Kollios George,Gunopulos Dimitrios,Tsotras Vassilis J.
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. P. Agarwal and M. Sharir. Arrangements and their applications. in Handbook of Computational Geometry, (J. Sack, ed.), North Holand, Amsterdam. 132
2. ArcView GIS. ArcView Tracking Analyst. 1998. 120
3. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, to appear. 132
4. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An Efficient and Robust Access Method For Points and Rectangles. In Proc. ACM-SIGMOD International Conference on Management of Data, pages 322–331, Atlantic City, May 1990. 126
5. S. Berchtold, C. Bohm, D. Keim, H.-P. Kriegel. A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space. In Proc. 16th ACM-PODS, pp. 78–86, 1997. 125
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献