An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.

Conway, J.H., and Sloane, N.J.A.. "An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.." Discrete & computational geometry 8.2 (1992): 131-152. <http://eudml.org/doc/131213>.

@article{Conway1992,
author = {Conway, J.H., Sloane, N.J.A.},
journal = {Discrete & computational geometry},
keywords = {algorithm; link center; simple -vertex polygon; link radius},
language = {eng},
number = {2},
pages = {131-152},
title = {An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.},
url = {http://eudml.org/doc/131213},
volume = {8},
year = {1992},
}

TY - JOUR
AU - Conway, J.H.
AU - Sloane, N.J.A.
TI - An O (n log n) Algorithm for Computing the Link Center of a Simple Polygon.
JO - Discrete & computational geometry
PY - 1992
VL - 8
IS - 2
SP - 131
EP - 152
LA - eng
KW - algorithm; link center; simple -vertex polygon; link radius
UR - http://eudml.org/doc/131213
ER -