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

From MaRDI portal
Publication:833568

DOI10.1016/J.ORL.2009.02.007zbMATH Open1167.90629OpenAlexW1586057350MaRDI QIDQ833568FDOQ833568

Horst W. Hamacher, Arie Tamir, Olga N. Gluchshenko

Publication date: 14 August 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.02.007




Recommendations




Cites Work


Cited In (18)





This page was built for publication: An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width

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