Smallest k point enclosing rectangle of arbitrary orientation.
Sandip Das, Partha P. Goswami, Subhas Chandra Nandy · Canadian Conference on Computational Geometry · 2004
Given a set of points in 2D, the problem of identi- fying the smallest rectangle of arbitrary orientation, and contain- ing exactly points is studied in this paper. The worst case time and space complexities of the proposed algorithm are and respectively. The algorithm is then used to identify the smallest square of arbitrary orientation containing points in time.