An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
From MaRDI portal
Publication:833568
DOI10.1016/j.orl.2009.02.007zbMath1167.90629OpenAlexW1586057350MaRDI QIDQ833568
Horst W. Hamacher, Olga N. Gluchshenko, Arie Tamir
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
Related Items (16)
On the minimum-area rectangular and square annulus problem ⋮ Computing a minimum-width square or rectangular annulus with outliers ⋮ Locating a minisum annulus: a new partial coverage distance model ⋮ Minimum-width rectangular annulus ⋮ Computing a minimum-width square annulus in arbitrary orientation ⋮ Empty squares in arbitrary orientation among points ⋮ Locating an axis-parallel rectangle on a Manhattan plane ⋮ Minimum Width Rectangular Annulus ⋮ Minimum width color spanning annulus ⋮ Minimum-width annulus with outliers: circular, square, and rectangular cases ⋮ Maximum-width empty square and rectangular annulus ⋮ Computing a Minimum-Width Square Annulus in Arbitrary Orientation ⋮ Computing a minimum-width cubic and hypercubic shell ⋮ Minimum Width Color Spanning Annulus ⋮ Computing a Minimum-Width Square or Rectangular Annulus with Outliers ⋮ Minimum-width double-strip and parallelogram annulus
Cites Work
- Unnamed Item
- Unnamed Item
- Equity models in planar location
- Extensive facility location problems on networks with equity measures
- Equity measurement in facility location analysis: A review and framework
- Improved algorithms for several network location problems with equality measures.
- Efficient randomized algorithms for some geometric optimization problems
- Approximating extent measures of points
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
This page was built for publication: An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
