Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference22 articles.
1. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor,A linear time algorithm for computing the Voronoi diagram of a convex polygon, Discrete and Comput. Geom. 4, 1989, 591–604.
2. A. Aggarwal, H. Imai, N. Katoh, and S. Suri,Finding k points with minimum diameter and related problems, J. Algorithms, to appear.
3. A. Aggarwal and J. Wein,Computational Geometry, MIT LCS Research Seminar Series 3, 1988.
4. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan,Time bounds for selection, J. Comput. Syst. Sci. 7, 1972, 448–461.
5. H. Booth and J. Westbrook,Linear algorithms for analysis of minimum spanning and shortest path trees in planar graphs, Tech. Rep. TR-763, Department of Computer Science, Yale University, Feb. 1990.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献