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

Discrete & computational geometry (1992)

- Volume: 8, Issue: 2, page 131-152
- ISSN: 0179-5376; 1432-0444/e

## Access Full Article

top## How to cite

topConway, 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 -

## NotesEmbed ?

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