| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438507 | Theoretical Computer Science | 2013 | 7 Pages |
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(n2logn) 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
