Author:
Aluru Srinivas,Sevilgen Fatih E.
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Aluru, S.: Greengard’s N-body algorithm is not order N. SIAM Journal on Scientific Computing 17 (1996) 773–776.
2. Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching. Proc. ACM-SIAM Symposium on Discrete Algorithms (1994) 573–582. 22
3. Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Journal of the ACM 45 (1998) 891–923. 22
4. Bern, M., Eppstein, D., Teng, S.H.: Parallel construction ofq uadtrees and quality triangulations. Proc. Workshop on Algorithms and Data Structures (1993) 188–199. 22, 25, 31
5. Bern, M.: Approximate closest-point queries in high dimensions. Information Processing Letters 45 (1993) 95–99. 22
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献