Discrete & Computational Geometry

, Volume 1, Issue 2, pp 155–182

A polynomial solution for the potato-peeling problem

  • J. S. Chang
  • C. K. Yap
Article

Abstract

The potato-peeling problem asks for the largest convex polygon contained inside a given simple polygon. We give anO(n7) time algorithm to this problem, answering a question of Goodman. We also give anO(n6) time algorithm if the desired polygon is maximized with respect to perimeter.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1986

Authors and Affiliations

  • J. S. Chang
    • 1
  • C. K. Yap
    • 1
  1. 1.Courant Institute of Mathematical SciencesNew York UniversityNew York

Personalised recommendations