An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.
Conway, J.H. ; Sloane, N.J.A.
Discrete & computational geometry, Tome 7 (1992), p. 131-152 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1992-01-01
EUDML-ID : urn:eudml:doc:131213 
@article{GDZPPN000365432,
     title = {An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.},
     journal = {Discrete \& computational geometry},
     volume = {7},
     year = {1992},
     pages = {131-152},
     language = {en},
     url = {http://dml.mathdoc.fr/item/GDZPPN000365432}
}

Conway, J.H.; Sloane, N.J.A. An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.. Discrete & computational geometry, Tome 7 (1992) pp. 131-152. http://gdmltest.u-ga.fr/item/GDZPPN000365432/