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
Hi-index | 5.23 |
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(n^2logn) time and O(n) space algorithm for this problem. To the best of our knowledge this is the first sub-cubic algorithm for a rectangular annulus for arbitrary orientation.