Find out how to access previewonly content
Discrete & Computational Geometry
, Volume 1, Issue 1, pp 155182
A polynomial solution for the potatopeeling problem
 J. S. ChangAffiliated withCourant Institute of Mathematical Sciences, New York University
 , C. K. YapAffiliated withCourant Institute of Mathematical Sciences, New York University
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The potatopeeling 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.
 Title
 A polynomial solution for the potatopeeling problem
 Journal

Discrete & Computational Geometry
Volume 1, Issue 1 , pp 155182
 Cover Date
 198612
 DOI
 10.1007/BF02187692
 Print ISSN
 01795376
 Online ISSN
 14320444
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

 J. S. Chang ^{(1)}
 C. K. Yap ^{(1)}
 Author Affiliations

 1. Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012, New York, NY