Geodesic
An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.
Discrete & computational geometry, Tome 8 (1992) no. 1, pp. 131-152.

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

Keywords: algorithm, link center, simple -vertex polygon, link radius 
@article{DCG_1992__8_1_131213,
     author = {J.H. Conway and N.J.A. Sloane},
     title = {An {O} (n log n) {Algorithm} for {Computing} the {Link} {Center} of a {Simple} {Polygon.}},
     journal = {Discrete & computational geometry},
     pages = {131--152},
     publisher = {mathdoc},
     volume = {8},
     number = {1},
     year = {1992},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DCG_1992__8_1_131213/}
}
TY  - JOUR
AU  - J.H. Conway
AU  - N.J.A. Sloane
TI  - An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.
JO  - Discrete & computational geometry
PY  - 1992
SP  - 131
EP  - 152
VL  - 8
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1992__8_1_131213/
LA  - en
ID  - DCG_1992__8_1_131213
ER  - 
%0 Journal Article
%A J.H. Conway
%A N.J.A. Sloane
%T An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.
%J Discrete & computational geometry
%D 1992
%P 131-152
%V 8
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1992__8_1_131213/
%G en
%F DCG_1992__8_1_131213
J.H. Conway; N.J.A. Sloane. An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.. Discrete & computational geometry, Tome 8 (1992) no. 1, pp. 131-152. http://geodesic.mathdoc.fr/item/DCG_1992__8_1_131213/