Minimum width rectangular annulus

Authors:
Joydeep Mukherjee;Priya Ranjan Sinha Mahapatra;Arindam Karmakar;Sandip Das
Affiliations:
Institute of Mathematical Sciences, Chennai, India;Department of Computer Science and Engineering, University of Kalyani, India;ACM Unit, Indian Statistical Institute, Kolkata, India;ACM Unit, Indian Statistical Institute, Kolkata, India
Venue:
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Year:
2011

Citing 8
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
An optimal algorithm for finding minimal enclosing triangles

Journal of Algorithms
Applications of parametric searching in geometric optimization

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for geometric optimization

ACM Computing Surveys (CSUR)
Offset-polygon annulus placement problems

WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Efficient approximation and optimization algorithms for computational metrology

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Davenport-Schinzel Sequences and their Geometric Applications

Davenport-Schinzel Sequences and their Geometric Applications
An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we identify a minimum width rectangular annulus that encloses a given set of n points in a plane. We propose an O(n2 log n) time and O(n) space algorithm for this problem. To the best of our knowledge this is the first sub-cubic algorithm for rectangular annulus for arbitrary orientation.