Lecture Notes in Computer Science Volume 166, 1984, pp 43-54
Date: 29 May 2005

Computing the largest empty rectangle

* Final gross prices may vary according to local VAT.

Get Access


We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result[13] takes O(N2) worst-case and O(Nlog2N) expected time. This paper presents an O(N log3N) time, O(N log N) space algorithm to solve this problem. It uses a divide-and-conquer approach similar to the ones used by Strong and Bentley[1] and introduces a new notion of Voronoi diagram along with a method for efficient computation of certain functions over paths of a tree.

Supported in part by the National Science Foundation under Grants MCS 83-42862, and ECS 81-21741.
A full version of this paper can be found in [4].