Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference22 articles.
1. A. Aggarwal, J. S. Chang, and C. K. Yap, Minimum area circumscribing polygons, to appear in a special issue of Visual Computer: International J. of Computer Graphics. Also, NYU-Courant Institute Robotics Lab. Report No. 42, May 1985.
2. M. Ben-Or, D. Kozen, and J. Reif, The complexity of elementary algebra and geometry, 16th STOC, 457–464, 1984.
3. J. E. Boyce, D. P. Dobkin, III, R. L. Drysdale, and L J. Guibas, Finding extremal polygons, 14th STOC, 282–289, 1982.
4. G. D. Chakerian, and L. H. Lange, Geometric extremum problems, Math. Mag. 44 (1971) 57–69.
5. J. S. Chang, and C. K. Yap, A polynomial solution to potato-peeling and other polygon inclusion and enclosure problems, 25th FOCS, 408–416, May 1984.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献