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

J. S. Chang, C. K. Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages408-416
Number of pages9
ISBN (Print)081860591X
StatePublished - 1984

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'POLYNOMIAL SOLUTION FOR POTATO-PEELING AND OTHER POLYGON INCLUSION AND ENCLOSURE PROBLEMS.'. Together they form a unique fingerprint.

Cite this