On the maximum empty rectangle problem
From MaRDI portal
Recommendations
Cites work
Cited in
(49)- A good sampling method for guessing rectangles in \([0,1]^2\)
- Fast parallel algorithms for the maximum empty rectangle problem.
- An upper bound of the minimal dispersion via delta covers
- Fast sequential and parallel algorithms for finding the largest rectangle separating two sets
- Faster algorithms for largest empty rectangles and boxes
- THE LARGEST EMPTY ANNULUS PROBLEM
- A note on the dispersion of admissible lattices
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- The minimal \(k\)-dispersion of point sets in high dimensions
- Polynomial time algorithms for bichromatic problems
- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
- A new algorithm for the largest empty rectangle problem
- On the minimum-area rectangular and square annulus problem
- Maximal strips data structure to represent free space on partially reconfigurable FPGAs
- Maximal empty coboids among points and blocks
- On the size of the largest empty box amidst a point set
- On Computing a Largest Empty Arbitrarily Oriented Rectangle
- Finding the largest area axis-parallel rectangle in a polygon
- A data mining approach for visual and analytical identification of neurorehabilitation ranges in traumatic brain injury cognitive rehabilitation
- Efficient algorithms for the largest rectangle problem
- scientific article; zbMATH DE number 219276 (Why is no real title available?)
- Variations of largest rectangle recognition amidst a bichromatic point set
- Finding the largest separating rectangle among two point sets
- Empty squares in arbitrary orientation among points
- Mining for empty spaces in large data sets.
- A note on minimal dispersion of point sets in the unit cube
- 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
- A note on finding a maximum empty rectangle
- Planar maximum-box problem revisited
- Largest empty rectangle among a point set
- On the rectangle escape problem
- Maximal empty boxes amidst random points
- Cutting rectangles avoiding rectangular defects
- On finding a widest empty 1-corner corridor
- A lower bound for the dispersion on the torus
- On the number of maximum empty boxes amidst \(n\) points
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
- Finding a largest rectangle inside a digital object and rectangularization
- Mining maximal frequent rectangles
- 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 2077118 (Why is no real title available?)
- Computing the Largest Empty Rectangle
- scientific article; zbMATH DE number 2080472 (Why is no real title available?)
- Deterministic constructions of high-dimensional sets with small dispersion
- scientific article; zbMATH DE number 3883624 (Why is no real title available?)
This page was built for publication: On the maximum empty rectangle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796307)
