A polynomial solution for the potato-peeling problem
- First Online:
- 189 Downloads
The potato-peeling problem asks for the largest convex polygon contained inside a given simple polygon. We give anO(n7) time algorithm to this problem, answering a question of Goodman. We also give anO(n6) time algorithm if the desired polygon is maximized with respect to perimeter.
Unable to display preview. Download preview PDF.