Author:
Fischer Matthias,Lukovszki Tamás,Ziegler Martin
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. Technical Report CS-1997-11, Duke Univ., Dep. of Comp. Sci., 1997. To appear: in Discrete and Computational Geometry: Ten Years Later.
2. A. Aggarwal, M. Hansen, and T. Leighton. Solving query-retrival problems by compact voronoi diagrams. In 22nd ACM Symposium on Theory of Computing (STOC’90), pages 331–340, 1990.
3. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In 5th ACM-SIAM Symposium on Discrete Algorithms (SODA’94), pages 573–582, 1994.
4. J. L. Bentley and H. A. Maurer. A note on the euclidean near neighbor searching in the plane. Information Processing Letters, 8:133–136, 1979.
5. M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation. J. Comp. Syst. Sci., 48:384–409, 1994.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献