A Polynomial Solution for the Potato-peeling Problem

  title={A Polynomial Solution for the Potato-peeling Problem},
  author={Jyun-Sheng Chang and Chee-Keng Yap},
  journal={Discrete & Computational Geometry},
The potato-peeling problem asks for the largest convex polygon contained inside a given simple polygon. We give an O(n 7) time algorithm to this problem, answering a question of Goodman. We also give an O(n 6) time algorithm if the desired polygon is maximized with respect to perimeter. 
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 42 extracted citations


Publications referenced by this paper.
Showing 1-8 of 8 references

Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition

Computer Vision, Graphics, and Image Processing • 1983
View 3 Excerpts
Highly Influenced

Approximations of Polygons and Polyhedra: Potentials for Research, Manuscript

A. Depano
View 1 Excerpt

Finding restricted K-envelopes for Convex Polygons

A. DePano, A. Aggarwal
Proc. of the 22nd Allerton Conference on Comm. Control and Computing, • 1984
View 2 Excerpts

On a general method for maximizing and minimizing among certain geometric problems

20th Annual Symposium on Foundations of Computer Science (sfcs 1979) • 1979
View 2 Excerpts

Similar Papers

Loading similar papers…