Author:
Guibas Leonidas J.,Knuth Donald E.,Sharir Micha
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference30 articles.
1. A. Aggarwal, H. Imai, N. Katoh, and S. Suri, Findingk points with minimum diameter and related problems,Proc. 5th ACM Symp. on Computational Geometry, 1989, pp. 283–291.
2. G. Andrews,The Theory of Partitions, Addison-Wesley, Reading, MA, 1976. (Encyclopedia of Mathematics and Its Applications, Volume 2.)
3. I. Bárány, J. Schmerl, S. Sidney, and J. Urrutia, A combinatorial result about points and balls in Euclidean space,Discrete Comput. Geom.,3 (1988), 259–262.
4. J. Bentley, B. Weide, and A. Yao, Optimal expected time algorithms for closest point problems,ACM Trans. Math. Software,6 (1980), 563–580.
5. J.-D. Boissonnat, and M. Teillaud, A hierarchical representation of objects: the Delaunay tree,Proc. 2nd ACM Symp. on Computational Geometry, 1986, pp. 260–268.
Cited by
282 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献