Skip to content

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

Hristo N. Djidjev, Andrzej Lingas, Jrg-Rdiger Sack

VenueASTACS
Year1989
ProceedingsSTACS

Browse the full STACS paper archive.