期刊名称：Journal of Emerging Trends in Computing and Information Sciences
电子版ISSN：2079-8407
出版年度：2012
卷号：3
期号：6
页码：1000-1003
出版社：ARPN Publishers
摘要：In Euclidean plane, a rectangular annulus is the region between parallel rectangles such that the smaller rectangle lies wholly inside the outer rectangle. Given a set P of n points in the two dimensional plane, we propose O(n2) time and O(n) space algorithm to identify an axis-parallel largest empty annulus amidst the points of P. We are not aware of any published work on this problem. To the best of our knowledge this is the rst O(n2) algorithm for recognition largest empty annulus.
