An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
From MaRDI portal
(Redirected from An optimal O(n n) algorithm for finding an enclosing planar rectilinear annulus of minimum width)
An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
