Author:
Agarwal Pankaj K.,Hagerup Torben,Ray Rahul,Sharir Micha,Smid Michiel,Welzl Emo
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. P.K. Agarwal, B. Aronov, M. Sharir, and S. Suri. Selecting distances in the plane. Algorithmica, 9:495–514, 1993.
2. N.M. Amato, M.T. Goodrich, and E. A. Ramos. Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pages 705–706, 2000.
3. G. Barequet, M. Dickerson, and P. Pau. Translating a convex polygon to contain a maximum number of points. Comput. Geom. Theory Appl., 8:167–179, 1997.
4. H. Bast and T. Hagerup. Fast and reliable parallel hashing. In Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 50–61, 1991.
5. H. Brönnimann, B. Chazelle, and J. Matou?sek. Product range spaces, sensitive sampling, and derandomization. SIAM J. Comput., 28:1552–1575, 1999. 51
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献