Maximal Empty Boxes Amidst Random Points
From MaRDI portal
Publication:5891110
DOI10.1017/S0963548313000187zbMath1311.68167MaRDI QIDQ5891110
Adrian Dumitrescu, Ming-Hui Jiang
Publication date: 26 July 2013
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Deterministic constructions of high-dimensional sets with small dispersion ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ A note on the dispersion of admissible lattices ⋮ On the number of maximum empty boxes amidst \(n\) points ⋮ Persistent homology in \(\ell_\infty\) metric
Cites Work
- A new algorithm for the largest empty rectangle problem
- On the maximum empty rectangle problem
- A note on finding a maximum empty rectangle
- An efficient algorithm for maxdominance, with applications
- Efficient algorithms for the largest rectangle problem
- Voronoi diagrams in higher dimensions under certain polyhedral distance functions
- Mining for empty spaces in large data sets.
- On the largest empty axis-parallel box amidst \(n\) points
- Efficient Colored Orthogonal Range Counting
- Computing the Largest Empty Rectangle
- Direct dominance of points
- On the Average Number of Maxima in a Set of Vectors and Applications
- An efficient algorithm for computing the maximum empty rectangle in three dimensions
This page was built for publication: Maximal Empty Boxes Amidst Random Points
