A note on finding a maximum empty rectangle

Abstract Given a rectangle A and a set S of n points in A , the maximum empty rectangle problem is that of finding a largest-area rectangle which is contained in A , has its sides parallel to those of A , and does not contain any of the points in S . This note describes an efficient algorithm for solving this problem.

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

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

[3]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..