Skip to search formSkip to main contentSkip to account menu

Largest empty rectangle

Known as: Maximal empty rectangle, Maximum empty rectangle 
In computational geometry, the largest empty rectangle problem, maximal empty rectangle problem or maximum empty rectangle problem, is the problem of… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Let S be a set of n points in a fixed axis-parallel rectangle $R\subseteq \Re^{2}$, i.e. in the two-dimensional space (2D… 
2010
2010
Massive parallel computing performed on many-core Network-on-Chips (NoCs) is the future of the computing. One feasible approach… 
Highly Cited
2005
Highly Cited
2005
A rectangleA and a setS ofn points inA are given. We present a new simple algorithm for the so-called largest empty rectangle… 
1999
1999
This paper generalizes the classical MER problem in 2D. Given a set P of n points, here a maximal empty rectangle (MER) is… 
1994
1994
This paper outlines the following generalization of the classical maximal-empty-rectangle (MER) problem: given n arbitrarily… 
Highly Cited
1987
Highly Cited
1987
We provide two algorithms for solving the following problem: Given a rectangle containing <italic>n</italic> points, compute the… 
1987
1987
Suppose we are given a two-dimensional rectangular surface upon which is placed a grating of size n by m square elements. The (n… 
Highly Cited
1986
Highly Cited
1986
We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel… 
Highly Cited
1984
Highly Cited
1984
We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel… 
Highly Cited
1984
Highly Cited
1984