A new algorithm for the largest empty rectangle problem

Recommendations

scientific article; zbMATH DE number 3883624
On the maximum empty rectangle problem
Largest empty rectangle among a point set
Computing the Largest Empty Rectangle
A note on finding a maximum empty rectangle

Cites work

A note on finding a maximum empty rectangle
Computing the Largest Empty Rectangle
On the maximum empty rectangle problem

Cited in

(30)

Computing the Largest Empty Rectangle
Polynomial time algorithms for bichromatic problems
On the minimum-area rectangular and square annulus problem
scientific article; zbMATH DE number 2077118 (Why is no real title available?)
A new algorithm for rectangle enclosure reporting
scientific article; zbMATH DE number 2080472 (Why is no real title available?)
Fast algorithms for finding disjoint subsequences with extremal densities
Largest empty rectangle among a point set
Maximal empty coboids among points and blocks
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
Empty squares in arbitrary orientation among points
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
scientific article; zbMATH DE number 3883624 (Why is no real title available?)
A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
Faster algorithms for largest empty rectangles and boxes
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

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)