Author:
Bose Prosenjit,Maheshwari Anil,Morin Pat,Morrison Jason
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. P. Agarwal, B. Bhattacharya, and S. Sen. Output-sensitive algorithms for uniform partitions of points. In Proceedings of the 10th International Symposium on Algorithms and Computation, 1999.
2. T. Asano and T. Tokuyama. Algorithms for projecting points to give the most uniform distribution with applications to hashing. Algorithmica, 9:572–590, 1993.
3. J. L. Bentley. Algorithms for Klee’s rectangle problems. Carnegie-Mellon University, Department of Computer Science, unpublished notes, 1977.
4. H. T. Kung, F. Luccio, and F. P. Preparata. On finding the maxima of a set of vectors. JACM, 22(4):469–476, 1975.
5. D. T. Lee. Maximum clique problem of rectangle graphs. In F. Preparata, editor, Advances in Computing Research, volume 1, pages 91–107. JAI Press Inc., 1983.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献