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

J. S. Chang, Chee 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

Fingerprint

Peeling
Enclosures
Polynomials

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Chang, J. S., & Yap, C. (1984). POLYNOMIAL SOLUTION FOR POTATO-PEELING AND OTHER POLYGON INCLUSION AND ENCLOSURE PROBLEMS. In 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.

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

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

Chang, JS & Yap, C 1984, POLYNOMIAL SOLUTION FOR POTATO-PEELING AND OTHER POLYGON INCLUSION AND ENCLOSURE PROBLEMS. in Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, pp. 408-416.
Chang JS, Yap C. POLYNOMIAL SOLUTION FOR POTATO-PEELING AND OTHER POLYGON INCLUSION AND ENCLOSURE PROBLEMS. In Annual Symposium on Foundations of Computer Science (Proceedings). IEEE. 1984. p. 408-416
Chang, J. S. ; Yap, Chee. / POLYNOMIAL SOLUTION FOR POTATO-PEELING AND OTHER POLYGON INCLUSION AND ENCLOSURE PROBLEMS. Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1984. pp. 408-416
@inproceedings{6771779055924588ad939450fc3b419b,
title = "POLYNOMIAL SOLUTION FOR POTATO-PEELING AND OTHER POLYGON INCLUSION AND ENCLOSURE PROBLEMS.",
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.",
author = "Chang, {J. S.} and Chee Yap",
year = "1984",
language = "English (US)",
isbn = "081860591X",
pages = "408--416",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "IEEE",

}

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 -