### 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 & Computational Geometry |

Volume | 1 |

Issue number | 1 |

DOIs | |

State | Published - Dec 1986 |

### ASJC Scopus subject areas

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

## Fingerprint Dive into the research topics of 'A polynomial solution for the potato-peeling problem'. Together they form a unique fingerprint.

## Cite this

Chang, J. S., & Yap, C. K. (1986). A polynomial solution for the potato-peeling problem.

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