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

Authors:
Olga N. Gluchshenko;Horst W. Hamacher;Arie Tamir
Affiliations:
University of Kaiserslautern, Germany;University of Kaiserslautern, Germany;School of Mathematical Sciences, Tel Aviv University, Israel
Venue:
Operations Research Letters
Year:
2009

Citing 5
Cited 2

Computational geometry: an introduction

Computational geometry: an introduction
Davenport-Schinzel sequences and their geometric applications

Davenport-Schinzel sequences and their geometric applications
Improved algorithms for several network location problems with equality measures

Discrete Applied Mathematics
Approximating extent measures of points

Journal of the ACM (JACM)
Extensive facility location problems on networks with equity measures

Discrete Applied Mathematics

Minimum width rectangular annulus

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Minimum-width rectangular annulus

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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(nlogn) algorithm for this problem.