作者
Joydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das
发表日期
2013/10/14
期刊
Theoretical Computer Science
卷号
508
页码范围
74-80
出版商
Elsevier
简介
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 2 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 a rectangular annulus for arbitrary orientation.
学术搜索中的文章
J Mukherjee, PRS Mahapatra, A Karmakar, S Das - Theoretical Computer Science, 2013