# A Polynomial Solution for the Potato-peeling Problem

@article{Chang1986APS, title={A Polynomial Solution for the Potato-peeling Problem}, author={Jyun-Sheng Chang and Chee-Keng Yap}, journal={Discrete & Computational Geometry}, year={1986}, volume={1}, pages={155-182} }

- Published 1986 in Discrete & Computational Geometry
DOI:10.1007/BF02187692

#### Citations

##### Publications citing this paper.

Showing 1-10 of 42 extracted citations

## Finding all Maximal Area Parallelograms in a Convex Polygon

View 10 Excerpts

Highly Influenced

## Peeling Potatoes Near-Optimally in Near-Linear Time

View 5 Excerpts

Highly Influenced

## Peeling Potatoes Near-Optimally in Near-Linear Time

View 5 Excerpts

Highly Influenced

## The Hausdorff Core Problem on Simple Polygons

View 5 Excerpts

Highly Influenced

## Hausdorff core of a one reflex vertex polygon

View 4 Excerpts

Highly Influenced

## Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance

View 4 Excerpts

Highly Influenced

## OPTIMAL SHAPE AND INCLUSION open problems

View 9 Excerpts

Highly Influenced

## Optimal Shape and Inclusion

View 9 Excerpts

Highly Influenced

## Fast approximation of the maximum area convex subset for star-shaped polygons

View 9 Excerpts

Highly Influenced

## Minimum-Perimeter Enclosing k-gon

View 4 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-8 of 8 references

## Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition

View 3 Excerpts

Highly Influenced

## Computing the Largest Empty Rectangle

View 2 Excerpts

## The Complexity of Elementary Algebra and Geometry

View 1 Excerpt

## Minimum area circumscribing Polygons

View 2 Excerpts

## Approximations of Polygons and Polyhedra: Potentials for Research, Manuscript

View 1 Excerpt

## Finding restricted K-envelopes for Convex Polygons

View 2 Excerpts