An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
From MaRDI portal
(Redirected from Publication:2380039)
An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
