A polynomial solution for the potato-peeling problem

J. S. Chang, Chee Yap

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)155-182
Number of pages28
JournalDiscrete and Computational Geometry
Volume1
Issue number1
DOIs
StatePublished - Dec 1986

Fingerprint

Polynomial Solutions
Peeling
Potato
Polynomials
Simple Polygon
Convex polygon
Perimeter
Polygon

ASJC Scopus subject areas

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

Cite this

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

In: Discrete and Computational Geometry, Vol. 1, No. 1, 12.1986, p. 155-182.

Research output: Contribution to journalArticle

@article{23dd41e825d742d99041b1773b051743,
title = "A polynomial solution for the potato-peeling problem",
abstract = "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.",
author = "Chang, {J. S.} and Chee Yap",
year = "1986",
month = "12",
doi = "10.1007/BF02187692",
language = "English (US)",
volume = "1",
pages = "155--182",
journal = "Discrete and Computational Geometry",
issn = "0179-5376",
publisher = "Springer New York",
number = "1",

}

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 -