Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack. An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. In Burkhard Monien, Robert Cori, editors, STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings. Volume 349 of Lecture Notes in Computer Science, pages 96-107, Springer, 1989.
@inproceedings{DjidjevLS89, title = {An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon}, author = {Hristo Djidjev and Andrzej Lingas and Jörg-Rüdiger Sack}, year = {1989}, researchr = {https://researchr.org/publication/DjidjevLS89}, cites = {0}, citedby = {0}, pages = {96-107}, booktitle = {STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings}, editor = {Burkhard Monien and Robert Cori}, volume = {349}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-50840-6}, }