An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon

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.

Abstract

Abstract is missing.