### Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 155-182 |

Number of pages | 28 |

Journal | Discrete and Computational Geometry |

Volume | 1 |

Issue number | 1 |

DOIs | |

State | Published - Dec 1986 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics

### Cite this

*Discrete and Computational Geometry*,

*1*(1), 155-182. https://doi.org/10.1007/BF02187692

**A polynomial solution for the potato-peeling problem.** / Chang, J. S.; Yap, Chee.

Research output: Contribution to journal › Article

*Discrete and Computational Geometry*, vol. 1, no. 1, pp. 155-182. https://doi.org/10.1007/BF02187692

}

TY - JOUR

T1 - A polynomial solution for the potato-peeling problem

AU - Chang, J. S.

AU - Yap, Chee

PY - 1986/12

Y1 - 1986/12

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0010423824&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0010423824&partnerID=8YFLogxK

U2 - 10.1007/BF02187692

DO - 10.1007/BF02187692

M3 - Article

VL - 1

SP - 155

EP - 182

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

IS - 1

ER -