Skip to main content

A new algorithm for the largest empty rectangle problem


A rectangleA and a setS ofn points inA are given. We present a new simple algorithm for the so-called largest empty rectangle problem, i.e., the problem of finding a maximum area rectangle contained inA and not containing any point ofS in its interior. The computational complexity of the presented algorithm isO(n logn + s), where s is the number of possible restricted rectangles considered. Moreover, the expected performance isO(n · logn).

This is a preview of subscription content, access via your institution.


  1. [1]

    M. J. Atallah and G. N. Frederickson, A note on finding a maximum empty rectangle,Discrete Applied Mathematics,13 (1986), 87–91.

    MATH  Article  MathSciNet  Google Scholar 

  2. [2]

    B. Chazelle, R. F. Drysdale, and D. T. Lee, Computing the largest empty rectangle,SIAM Journal of Computing,15 (1986), 300–315.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    A. Namaad, W. L. Hsu, and D. T. Lee, On the maximum empty rectangle problem,Applied Discrete Mathematics,8 (1984), 267–277.

    Article  Google Scholar 

  4. [4]

    G. T. Toussaint and D. Avis, On a convex hull algorithm for polygons and its applications to triangulation problems,Pattern Recognition,15 (1982), 23–29.

    Article  MathSciNet  Google Scholar 

Download references

Author information



Additional information

Communicated by D. T. Lee.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Orlowski, M. A new algorithm for the largest empty rectangle problem. Algorithmica 5, 65–73 (1990).

Download citation

Key words

  • Computational geometry
  • Algorithms
  • Computational complexity
  • Largest empty rectangle problem