Largest Empty Rectangle

Largest Empty Rectangle

The Largest Empty Rectangle problem is defined as the following: Given a rectangle and points inside it, compute the largest axis parallel subrectangle that lies within the rectangle and contains no points in its interior.Although the paper on which we base the implementation does not deal with degeneracies (two or more points which have the same X or Y value), we made some modification to handle them.

An implementation of the algorithm to compute the largest empty rectangle has been added to the CGAL distribution.


  • M. Orlowski, A new algorithm for the largest empty rectangle, Algorithmica,  5: 65-73, 1990 [link]


Eli Packer

Yair Oz - Webcreator


Skip to content