An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
From MaRDI portal
(Redirected from An O(n n) algorithm for computing the link center of a simple polygon)
An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
