, Volume 1, Issue 1, pp 155-182

A polynomial solution for the potato-peeling problem

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


The potato-peeling problem asks for the largest convex polygon contained inside a given simple polygon. We give anO(n 7) time algorithm to this problem, answering a question of Goodman. We also give anO(n 6) time algorithm if the desired polygon is maximized with respect to perimeter.