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 number of anchored rectangle packings for a planar point set
2015
2015
A Data Mining Approach for Visual and Analytical Identification of Neurorehabilitation Ranges in Traumatic Brain Injury Cognitive Rehabilitation
Traumatic brain injury (TBI) is a critical public health and socioeconomic problem throughout the world. Cognitive rehabilitation… 
2014
2014
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… 
2014
2014
A note on a 2-enumeration of antisymmetric monotone triangles
  • T. Lai
  • 2014
  • Corpus ID: 117583605
In their unpublished work, Jockusch and Propp showed that a 2-enumeration of antisymmetric monotone triangles is given by a… 
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… 
2010
2010
Key Pre-Distribution Schemes for Large-Scale Wireless Sensor Networks Using Hexagon Partition
Key distribution plays an important role in wireless sensor networks (WSNs), for information must be kept secure, even in an… 
2008
2008
Maximal Empty Rectangle Based Reconfigurable Resource Management Method
With the improvement of the size and integration degree of the reconfigurable hardware such as FPGA, more hardware tasks can run… 
1990
1990
Efficient Algorithms for the Maximum Empty Rectangle Problem in Shared Memory and Other Architectures
1987
1987
Finding the Largest Empty Rectangle on a Grated Surface
Suppose we are given a two-dimensional rectangular surface upon which is placed a grating of size n by m square elements. The (n… 
1987
1987
New Parallel Algorithms for the Maximum Empty Rectangle Problem
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)