The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
From MaRDI portal
Publication:3557005
DOI10.1007/978-3-642-12200-2_3zbMath1283.52017OpenAlexW1569585172MaRDI QIDQ3557005
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_3
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55)
Related Items (12)
Deterministic constructions of high-dimensional sets with small dispersion ⋮ Mini-Minimax Uncertainty Quantification for Emulators ⋮ Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension ⋮ The class cover problem with boxes ⋮ Faster algorithms for largest empty rectangles and boxes ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ On the largest empty axis-parallel box amidst \(n\) points ⋮ Polynomial Time Algorithms for Bichromatic Problems ⋮ Maximum-weight planar boxes in \(O(n^2)\) time (and better) ⋮ On the number of maximum empty boxes amidst \(n\) points ⋮ Planar maximum-box problem revisited ⋮ Maximum box problem on stochastic points
This page was built for publication: The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
