Smallest k-point enclosing rectangle and square of arbitrary orientation

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(n2 logn + 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(n2 logn + kn(n - k)2 logn) time.

[1]  Franco P. Preparata,et al.  Widest-Corridor Problems , 1994, Nord. J. Comput..

[2]  Sandip Das,et al.  Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment , 2004, Comput. Geom..

[3]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[4]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[5]  Alok Aggarwal,et al.  Finding k Points with Minimum Diameter and Related Problems , 1991, J. Algorithms.

[6]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[7]  Earl E. Swartzlander,et al.  Introduction to Mathematical Techniques in Pattern Recognition , 1973 .

[8]  Raimund Seidel,et al.  Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..

[9]  Michael Segal,et al.  Enclosing k Points in the Smallest Axis Parallel Rectangle , 1998, Inf. Process. Lett..

[10]  David Eppstein,et al.  Iterated nearest neighbors and finding minimal polytopes , 1993, SODA '93.

[11]  Herbert Edelsbrunner,et al.  Constructing Belts in Two-Dimensional Arrangements with Applications , 1986, SIAM J. Comput..

[12]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

[13]  Michiel H. M. Smid,et al.  Static and Dynamic Algorithms for k-Point Clustering Problems , 1995, J. Algorithms.

[14]  Tetsuo Asano,et al.  Clustering algorithms based on minimum and maximum spanning trees , 1988, SCG '88.

[15]  J. Matoušek,et al.  On geometric optimization with few violated constraints , 1994, SCG '94.

[16]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.