A note on finding a maximum empty rectangle
From MaRDI portal
Recommendations
Cites work
Cited in
(20)- Fast parallel algorithms for the maximum empty rectangle problem.
- Fast sequential and parallel algorithms for finding the largest rectangle separating two sets
- A new algorithm for the largest empty rectangle problem
- On Computing a Largest Empty Arbitrarily Oriented Rectangle
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
- Efficient algorithms for the largest rectangle problem
- Mining for empty spaces in large data sets.
- scientific article; zbMATH DE number 4033105 (Why is no real title available?)
- On the largest empty axis-parallel box amidst \(n\) points
- An efficient algorithm for computing the maximum empty rectangle in three dimensions
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
- Largest empty rectangle among a point set
- On the maximum empty rectangle problem
- Maximal empty boxes amidst random points
- Fast algorithms for finding disjoint subsequences with extremal densities
- On the number of maximum empty boxes amidst \(n\) points
- An efficient algorithm for maxdominance, with applications
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- scientific article; zbMATH DE number 2080472 (Why is no real title available?)
- scientific article; zbMATH DE number 3883624 (Why is no real title available?)
This page was built for publication: A note on finding a maximum empty rectangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079570)
