Geodesic
A Polynomial Solution for the Potato-peeling Problem.
Discrete & computational geometry, Tome 1 (1986), pp. 155-182.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : computational geometry, largest inscribed polygon, polynomial, algorithm, minimal area potato-peeling problem, minimal perimeter 
@article{DCG_1986__1_130988,
     author = {J.S. Chang and C.K. Yap},
     title = {A {Polynomial} {Solution} for the {Potato-peeling} {Problem.}},
     journal = {Discrete & computational geometry},
     pages = {155--182},
     publisher = {mathdoc},
     volume = {1},
     year = {1986},
     zbl = {0593.52007},
     url = {http://geodesic.mathdoc.fr/item/DCG_1986__1_130988/}
}
TY  - JOUR
AU  - J.S. Chang
AU  - C.K. Yap
TI  - A Polynomial Solution for the Potato-peeling Problem.
JO  - Discrete & computational geometry
PY  - 1986
SP  - 155
EP  - 182
VL  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1986__1_130988/
ID  - DCG_1986__1_130988
ER  - 
%0 Journal Article
%A J.S. Chang
%A C.K. Yap
%T A Polynomial Solution for the Potato-peeling Problem.
%J Discrete & computational geometry
%D 1986
%P 155-182
%V 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1986__1_130988/
%F DCG_1986__1_130988
J.S. Chang; C.K. Yap. A Polynomial Solution for the Potato-peeling Problem.. Discrete & computational geometry, Tome 1 (1986), pp. 155-182. http://geodesic.mathdoc.fr/item/DCG_1986__1_130988/