### Abstract

A finiteness criterion for the potato-peeling problem is given that asks for the largest convex polygon (potato) contained inside a given simple polygon, answering a question of J. Goodman. This leads to a polynomial-time solution of O(n**9 log n). The techniques used turn out to be useful for other cases of what are called the polygon inclusion and enclosure problems. For instance, the largest perimeter potato can be found in O(n**6 ) time, and finding the smallest k-gon enclosing a given polygon can be done in O(n**3 log k) steps.

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

Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |

Publisher | IEEE |

Pages | 408-416 |

Number of pages | 9 |

ISBN (Print) | 081860591X |

State | Published - 1984 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Annual Symposium on Foundations of Computer Science (Proceedings)*(pp. 408-416). IEEE.

**POLYNOMIAL SOLUTION FOR POTATO-PEELING AND OTHER POLYGON INCLUSION AND ENCLOSURE PROBLEMS.** / Chang, J. S.; Yap, Chee.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Annual Symposium on Foundations of Computer Science (Proceedings).*IEEE, pp. 408-416.

}

TY - GEN

T1 - POLYNOMIAL SOLUTION FOR POTATO-PEELING AND OTHER POLYGON INCLUSION AND ENCLOSURE PROBLEMS.

AU - Chang, J. S.

AU - Yap, Chee

PY - 1984

Y1 - 1984

N2 - A finiteness criterion for the potato-peeling problem is given that asks for the largest convex polygon (potato) contained inside a given simple polygon, answering a question of J. Goodman. This leads to a polynomial-time solution of O(n**9 log n). The techniques used turn out to be useful for other cases of what are called the polygon inclusion and enclosure problems. For instance, the largest perimeter potato can be found in O(n**6 ) time, and finding the smallest k-gon enclosing a given polygon can be done in O(n**3 log k) steps.

AB - A finiteness criterion for the potato-peeling problem is given that asks for the largest convex polygon (potato) contained inside a given simple polygon, answering a question of J. Goodman. This leads to a polynomial-time solution of O(n**9 log n). The techniques used turn out to be useful for other cases of what are called the polygon inclusion and enclosure problems. For instance, the largest perimeter potato can be found in O(n**6 ) time, and finding the smallest k-gon enclosing a given polygon can be done in O(n**3 log k) steps.

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

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

M3 - Conference contribution

SN - 081860591X

SP - 408

EP - 416

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -