The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
From MaRDI portal
Publication:3557005
Recommendations
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
- Monochromatic rectangles in grid colorings
- On monochromatic subsets of a rectangular grid
- Almost empty monochromatic quadrilaterals in planar point sets
- Combinatorial properties of triangle-free rectangle arrangements and the squarability problem
- Transforming rectangles into squares, with applications to strong colorings
- Bipartite graphs and monochromatic squares
- On combinatorial rectangles with minimum \(\infty \)-discrepancy
- The Rectangle Enclosure and Point-Dominance Problems Revisited
- On the maximum empty rectangle problem
Cited in
(14)- Polynomial time algorithms for bichromatic problems
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension
- Maximum box problem on stochastic points
- Mini-minimax uncertainty quantification for emulators
- On the number of maximum empty boxes amidst \(n\) points
- Planar maximum-box problem revisited
- Maximum-weight planar boxes in \(O(n^2)\) time (and better)
- Deterministic constructions of high-dimensional sets with small dispersion
- On the largest empty axis-parallel box amidst \(n\) points
- Tight hardness results for maximum weight rectangles
- The class cover problem with boxes
- An efficient algorithm for computing the maximum empty rectangle in three dimensions
- Faster algorithms for largest empty rectangles and boxes
- Variations of largest rectangle recognition amidst a bichromatic point set
This page was built for publication: The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557005)
