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 (opens in a new tab)

Related topics

Related topics

13 relations
Computational geometryCuboidElectronic design automationImage processing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
On the numbers of perfect matchings of trimmed Aztec rectangles
We consider several new families of graphs obtained from Aztec rectangle and augmented Aztec rectangle graphs by trimming two… 
2014
2014
A note on a 2-enumeration of antisymmetric monotone triangles
In their unpublished work, Jockusch and Propp showed that a 2-enumeration of antisymmetric monotone triangles is given by a… 
2014
2014
Enumeration of tilings of quartered lozenge hexagons and quartered Aztec rectangles
We prove a simple product formula for the number of tilings the quarter of a hexagonal region with some defects in the triangular… 
2012
2012
Optimal Planar Range Skyline Reporting with Linear Space in External Memory
Let P be a set of n points in R^2. Given a rectangle Q = [\alpha_1, \alpha_2] x [\beta_1, \beta_2], a range skyline query returns… 
2006
2006
Considerations About The Anomalous Eciency Of Particular Thermodynamic Cycles
Some years ago Vignati (refs. 1, 2, 3) showed that, under some particular circumstances (inter alia : isobaric processes… 
2003
2003
On finding a maximum empty rectangle of arbitrary orientation: Theory and implementation.
1990
1990
Efficient Algorithms for the Maximum Empty Rectangle Problem in Shared Memory and Other Architectures
1986
1986
Finding the largest empty rectangle on a grated surface.