Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

13 relations
Computational geometryCuboidElectronic design automationImage processing
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The largest empty rectangle containing only a query object in Spatial Databases
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2005
2005
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… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2003
2003
Largest empty rectangle among a point set
This work generalizes the classical problem of finding the largest empty rectangle among obstacles in 2D. Given a set P of n… Expand
Is this relevant?
1999
1999
Largest Empty Rectangle among a Point Set
This paper generalizes the classical MER problem in 2D. Given a set P of n points, here a maximal empty rectangle (MER) is… Expand
Is this relevant?
1994
1994
Location of the Largest Empty Rectangle among Arbitrary Obstacles
This paper outlines the following generalization of the classical maximal-empty-rectangle (MER) problem: given n arbitrarily… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1990
1990
Computing the Largest Empty Rectangle on One- and Two-Dimensional Processor Arrays
  • Frank Dehne
  • J. Parallel Distributed Comput.
  • 1990
    • Corpus ID: 3139695
Abstract Given a rectangle R (with its edges parallel to the coordinate axes) containing a set S = { s1,…,sn} of n points in the… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Fast algorithms for computing the largest empty rectangle
We provide two algorithms for solving the following problem: Given a rectangle containing <italic>n</italic> points, compute the… Expand
  • figure 1
  • figure 2
Is this relevant?
1986
1986
Computing the Largest Empty Rectangle
We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Computing the Largest Empty Rectangle
We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1984
Highly Cited
1984
On the maximum empty rectangle problem
Abstract Given a rectangle A and a set S of n points in A, we consider the problem, called the maximum empty rectangle problem… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE