largest rectangle area Algorithm

In computational geometry, the largest empty rectangle problem, maximal empty rectangle problem or maximal empty rectangle problem, is the problem of finding a rectangle of maximal size to be put among obstacles in the airplane. In the contexts of many algorithms for largest empty rectangles," maximal empty rectangles" are candidate solutions to be considered by the algorithm, since it is easily proven that, e.g., a maximal-area empty rectangle is a maximal empty rectangle.

largest rectangle area source code, pseudocode and analysis