Discrete & Computational Geometry

, Volume 1, Issue 2, pp 155–182

A polynomial solution for the potato-peeling problem

Authors

  • J. S. Chang
    • Courant Institute of Mathematical SciencesNew York University
  • C. K. Yap
    • Courant Institute of Mathematical SciencesNew York University
Article

DOI: 10.1007/BF02187692

Cite this article as:
Chang, J.S. & Yap, C.K. Discrete Comput Geom (1986) 1: 155. doi:10.1007/BF02187692

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.

Copyright information

© Springer-Verlag New York Inc. 1986