Maximum Area Rectangle Separating Red and Blue Points

Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has the largest area. We call such rectangle a maximum separating rectangle. We address the planar, axis-aligned (2D) version, and present an O(mlogm+n) time, O(m+n) space algorithm. The running time reduces to O(m + n) if the points are pre-sorted by one of the coordinates. We further prove that our algorithm is optimal in the decision model of computation.

[1]  Subhas C. Nandy,et al.  Location of the Largest Empty Rectangle among Arbitrary Obstacles , 1994, FSTTCS.

[2]  Alok Aggarwal,et al.  Fast algorithms for computing the largest empty rectangle , 1987, SCG '87.

[3]  Subhas C. Nandy,et al.  Largest Empty Rectangle among a Point Set , 1999, FSTTCS.

[4]  D. T. Lee,et al.  On the maximum empty rectangle problem , 1984, Discret. Appl. Math..

[5]  Ovidiu Daescu,et al.  Minimum Separating Circle for Bichromatic Points in the Plane , 2010, 2010 International Symposium on Voronoi Diagrams in Science and Engineering.

[6]  Ovidiu Daescu,et al.  Dynamic Minimum Bichromatic Separating Circle , 2015, COCOA.

[7]  N. Megiddo,et al.  Computing circular separability , 1986 .

[8]  Adrian Dumitrescu,et al.  On the Largest Empty Axis-Parallel Box Amidst n Points , 2009, Algorithmica.

[9]  Daniel J. Kleitman,et al.  An Almost Linear Time Algorithm for Generalized Matrix Searching , 1990, SIAM J. Discret. Math..

[10]  Adrian Dumitrescu,et al.  On the Number of Maximum Empty Boxes Amidst n Points , 2018, Discret. Comput. Geom..

[11]  Haim Kaplan,et al.  Finding the Maximal Empty Rectangle Containing a Query Point , 2011, ArXiv.

[12]  Bernard Chazelle,et al.  Computing the Largest Empty Rectangle , 1984, SIAM J. Comput..

[13]  Amitava Datta,et al.  An efficient algorithm for computing the maximum empty rectangle in three dimensions , 2000, Inf. Sci..

[14]  Haim Kaplan,et al.  Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications , 2017, ACM Trans. Algorithms.

[15]  Haim Kaplan,et al.  Finding the maximal empty disk containing a query point , 2012, SoCG '12.

[16]  Nimrod Megiddo,et al.  On the complexity of polyhedral separability , 1988, Discret. Comput. Geom..

[17]  Bhargab B Bhattacharya,et al.  Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design , 1990, FSTTCS.

[18]  Subhas C. Nandy,et al.  Maximal Empty Cuboids Among Points and Blocks , 1998 .

[19]  Asish Mukhopadhyay,et al.  Computing a Largest Empty Arbitrary Oriented Rectangle: Theory and Implementation , 2003, ICCSA.