A new algorithm for the largest empty rectangle problem
From MaRDI portal
DOI10.1007/BF01840377zbMATH Open0689.68065OpenAlexW2997188414MaRDI QIDQ582097FDOQ582097
Authors: Jianyong Qiao, Sumit K. Garg 
Publication date: 1990
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01840377
Recommendations
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25)
Cites Work
Cited In (30)
- Polynomial time algorithms for bichromatic problems
- Title not available (Why is that?)
- On the minimum-area rectangular and square annulus problem
- A new algorithm for rectangle enclosure reporting
- Title not available (Why is that?)
- Fast algorithms for finding disjoint subsequences with extremal densities
- Largest empty rectangle among a point set
- Maximal empty coboids among points and blocks
- Empty squares in arbitrary orientation among points
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
- An arbitrarily high-order three-dimensional Cartesian-grid method for reconstructing interfaces from volume fraction fields
- Mining for empty spaces in large data sets.
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- On the maximum empty rectangle problem
- A note on finding a maximum empty rectangle
- On the largest empty axis-parallel box amidst \(n\) points
- An efficient algorithm for maxdominance, with applications
- An efficient algorithm for computing the maximum empty rectangle in three dimensions
- Title not available (Why is that?)
- Faster algorithms for largest empty rectangles and boxes
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
- Efficient algorithms for the largest rectangle problem
- An optimal algorithm for rectangle placement
- Maximal strips data structure to represent free space on partially reconfigurable FPGAs
- On Computing a Largest Empty Arbitrarily Oriented Rectangle
- Maximal empty boxes amidst random points
- Fast parallel algorithms for the maximum empty rectangle problem.
- Variations of largest rectangle recognition amidst a bichromatic point set
- Computing the Largest Empty Rectangle
This page was built for publication: A new algorithm for the largest empty rectangle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582097)
