An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width

From MaRDI portal

(Redirected from Publication:833568)
An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width

Jump to:navigation, search

MaRDI QID[[Item:|]]

Authors

No records found

Cited in

No records found

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item )

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_optimal_%5C(O(n%5Clog_n)%5C)_algorithm_for_finding_an_enclosing_planar_rectilinear_annulus_of_minimum_width&oldid=64716447"