# A Polynomial Solution for the Potato-peeling Problem.

Discrete & computational geometry (1986)

- Volume: 1, page 155-182
- ISSN: 0179-5376; 1432-0444/e

## Access Full Article

top## How to cite

topChang, J.S., and Yap, C.K.. "A Polynomial Solution for the Potato-peeling Problem.." Discrete & computational geometry 1 (1986): 155-182. <http://eudml.org/doc/130988>.

@article{Chang1986,

author = {Chang, J.S., Yap, C.K.},

journal = {Discrete & computational geometry},

keywords = {computational geometry; largest inscribed polygon; polynomial; algorithm; minimal area potato-peeling problem; minimal perimeter},

pages = {155-182},

title = {A Polynomial Solution for the Potato-peeling Problem.},

url = {http://eudml.org/doc/130988},

volume = {1},

year = {1986},

}

TY - JOUR

AU - Chang, J.S.

AU - Yap, C.K.

TI - A Polynomial Solution for the Potato-peeling Problem.

JO - Discrete & computational geometry

PY - 1986

VL - 1

SP - 155

EP - 182

KW - computational geometry; largest inscribed polygon; polynomial; algorithm; minimal area potato-peeling problem; minimal perimeter

UR - http://eudml.org/doc/130988

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.