Author:
Eppstein David,Overmars Mark,Rote Günter,Woeginger Gerhard
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference14 articles.
1. A. Aggarwal and J. Wein,Computational Geometry, Lecture Notes for 18.409, MIT Laboratory for Computer Science, 1988.
2. A. Aggarwal, M. M. Klawe, S. Moran, P. Shor, and R. Wilber, Geometric applications of a matrix-searching algorithm,Algorithmica 2 (1987), 195–208.
3. 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.
4. D. Avis and D. Rappaport, Computing the largest empty convex subset of a set of points,Proc. 1st ACM Symp. on Computational Geometry, 1985, pp. 161–167.
5. J. E. Boyce, D. P. Dobkin, R. L. Drysdale, and L. J. Guibas, Finding extremal polygons,SIAM J. Comput. 14 (1985), 134–147.
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献