Author:
Gudmundsson Joachim,van Kreveld Marc,Speckmann Bettina
Publisher
Springer Science and Business Media LLC
Subject
Geography, Planning and Development,Information Systems
Reference30 articles.
1. B. Aronov and S. Har-Peled. “On approximating the depth and related problems,” in Proc. of 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 886–894, 2005.
2. S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A.Y. Wu. “An optimal algorithm for approximate nearest neighbor searching fixed dimensions,” Journal of the ACM, Vol. 45(6):891–923, 1998.
3. J.L. Bentley. “Decomposable searching problems,” Information Processing Letters, Vol. 8:244–251, 1979.
4. T.M. Chan. “Approximate nearest neighbor queries revisited,” Discrete and Computational Geometry, Vol. 20(3):359–373, 1998.
5. B. Chazelle. “Cutting hyperplanes for divide-and-conquer,” Discrete and Computational Geometry, Vol. 9(2):145–158, 1993.
Cited by
77 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献