The potato-peeling problem asks for the largest convex polygon contained inside a given simple polygon. We give an O(n7) time algorithm to this problem, answering a question of Goodman. We also give an O(n6) time algorithm if the desired polygon is maximized with respect to perimeter.
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics