作者
Sandip Das, Partha P Goswami, Subhas C Nandy
发表日期
2005/6/30
期刊
Information Processing Letters
卷号
94
期号
6
页码范围
259-266
出版商
Elsevier
简介
Given a set of n points in 2D, the problem of identifying the smallest rectangle of arbitrary orientation, and containing exactly k(⩽n) points is studied in this paper. The worst case time and space complexities of the proposed algorithm are O(n2logn+nk(n−k)(n−k+logk)) and O(n), respectively. The algorithm is then used to identify the smallest square of arbitrary orientation, and containing exactly k points in O(n2logn+kn(n−k)2logn) time.
学术搜索中的文章
S Das, PP Goswami, SC Nandy - Information Processing Letters, 2005