Author:
Cheong Otfried,Shin Chan-Su,Vigneron Antoine
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Pankaj K. Agarwal, J. Matouísek, and Subhash Suri Farthest neighbors, maximum spanning trees and related problems in higher dimensions. Comput. Geom. Theory Appl., 1(4):189–201, 1992.
2. A. Aggarwal and D. Kravets A linear time algorithm for finding all farthest neighbors in a convex polygon. Information Processing letters, 31(1):17–20, 1989.
3. Sergei N. Bespamyatnikh An efficient algorithm for the three-dimensional diameter problem. In Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, pages 137–146, 1998.
4. K.L. Clarkson and P.W. Shor Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387–421, 1989.
5. K. Mulmuley Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1994.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. COMPUTING THE DIAMETER OF A POINT SET;International Journal of Computational Geometry & Applications;2002-12