Author:
Beier René,Sanders Peter,Sivadasan Naveen
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. P. D. Agarwal and J. Matousek. Ray shooting and parametric search. In N. Alon, editor, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 517–526, Victoria, B.C., Canada, May 1992. ACM Press.
2. J. Bentley, B. W. Weide, and A. C. Yao. Optimal expected-time algorithms for closest point problems. ACM Transactions on Mathematical Software, 6(4):563–580, December 1980.
3. T. Chan. Approximate nearest neighbor queries revisited. In Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), pages 352–358, New York, June 4–6 1997. ACM Press.
4. T. Chan and A. Efrat. Fly cheaply: On the minimum fuel consumption problem. Journal of Algorithms, 41(2):330–337, November 2001.
5. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry Algorithms and Applications. Springer-Verlag, Berlin Heidelberg, 2., rev. ed. edition, 2000.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献