Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference31 articles.
1. N. M. Amato. Computing the minimum visible vertex distance between two nonintersecting simple polygons.Proc. 1992 Conf. on Information Science and Systems, Vol. II, pp. 800?805, Princeton, NJ, 1992.
2. D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra-a unified approach.Proc. 17th Internat. Colloq. on Automata Language Programming, pp. 400?413. Lecture Notes in Computer Science, Vol. 443. Springer-Verlag, Berlin, 1990.
3. M. McKenna and G. T. Toussaint. Finding the minimum vertex distance between two disjoint convex polygons in linear time.Comput. Math. Appl., 11:1227?1242, 1985.
4. G. T. Toussaint. An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons.Computing, 32:357?364, 1984.
5. F. Chin, J. Sampson, and C. A. Wang. A unified approach for a class of problems in the computational geometry of polygons.Visual Comput., 1:124?132, 1985.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献