@inproceedings{0b7f2e54c0c54357aa57507193d65121,

title = "Computing the link center of a simple polygon",

abstract = "The link center of a simple polygon P is the set of points x inside P at which the maximal link-distancefrom x to any other point in P is minimized, where the link distance between two points x, y inside P isdefined as the smallest number of straight edges in a polygonal path inside P connecting x to y. We proveseveral geometric properties of the link center and present an algorithm that calculates this set in time0(n2), where n is the number of sides of P. We also give an 0 (n log n) algorithm for finding apoint x in an approximate link center, namely the maximal link distance from x to any point in P is at most one more than the value attained from the link center.",

author = "W. Lenhart and R. Pollack and J. Sack and R. Seidel and M. Shari and S. Suri and G. Toussaint and S. Whitesides and C. Yap",

note = "Publisher Copyright: {\textcopyright} 1987 ACM.; 3rd Annual Symposium on Computational Geometry, SCG 1987 ; Conference date: 08-06-1987 Through 10-06-1987",

year = "1987",

month = oct,

day = "1",

doi = "10.1145/41958.41959",

language = "English (US)",

series = "Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987",

publisher = "Association for Computing Machinery, Inc",

pages = "1--10",

editor = "D. Soule",

booktitle = "Proceedings of the 3rd Annual Symposium on Computational Geometry, SCG 1987",

}