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

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Given a set P of n points in the plane, we consider the problem of finding a planar rectilinear annulus of minimum width which encloses the set P. We present an optimal O (n log n) algorithm for this problem.

Original languageEnglish
Pages (from-to)168-170
Number of pages3
JournalOperations Research Letters
Volume37
Issue number3
DOIs
StatePublished - May 2009

Funding

FundersFunder number
Technische Universität Kaiserslautern
Deutsche Forschungsgemeinschaft

    Keywords

    • Facility location
    • Minimum width annulus
    • Optimal algorithm
    • Planar location
    • Rectilinear annulus

    Fingerprint

    Dive into the research topics of 'An optimal O (n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum width'. Together they form a unique fingerprint.

    Cite this