Author:
Fleischer Rudolf,Mehlhorn Kurt,Rote Günter,Welzl Emo,Yap Chee
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference14 articles.
1. A. Aggarwal, J. S. Chang, and C. K. Yap, Minimum area circumscribing polygons,Visual Comput. Internat. J. Comput. Graphics 1 (1985), 112–117.
2. H. Alt, R. Fleischer, M. Kaufmann, K. Mehlhorn, S. Näher, S. Schirra, and C. Uhrig, Approximate motion planning and the complexity of the boundary of the union of simple geometric figures, inProc. Sixth Annual Symposium on Computational Geometry, 1990, pp. 281–289.
3. B. Chazelle, The polygon containment problem,Adv. Comput. Res. 1 (1983), 1–33.
4. D. Dobkin and L. Snyder, On a general method for maximizing and minimizing among certain geometric problems, inProc. 20th Annual IEEE Symposium on Foundations of Computer Science, 1979, pp. 9–17.
5. L. Fejes Tóth,Lagerungen in der Ebene, auf der Kugel und im Raum, Springer-Verlag, Berlin, 1953.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献