On the number of maximum empty boxes amidst \(n\) points
From MaRDI portal
Publication:1745207
DOI10.1007/s00454-017-9871-1zbMath1390.68717OpenAlexW2590702107MaRDI QIDQ1745207
Adrian Dumitrescu, Ming-Hui Jiang
Publication date: 20 April 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-017-9871-1
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (2)
Deterministic constructions of high-dimensional sets with small dispersion ⋮ Faster algorithms for largest empty rectangles and boxes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- On the maximum empty rectangle problem
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Applications of generalized matrix searching to geometric algorithms
- A note on finding a maximum empty rectangle
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Geometric applications of a matrix-searching algorithm
- Mining for empty spaces in large data sets.
- Maximal empty coboids among points and blocks
- Quasi-Monte-Carlo methods and the dispersion of point sequences
- On the largest empty axis-parallel box amidst \(n\) points
- On the size of the largest empty box amidst a point set
- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
- Efficient Colored Orthogonal Range Counting
- Computing the Largest Empty Rectangle
- MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS
- Maintenance of geometric extrema
- A Combinatorial Problem Connected with Differential Equations
- Maximal Empty Boxes Amidst Random Points
- Geometric discrepancy. An illustrated guide
- Some extremal problems in geometry
- An efficient algorithm for computing the maximum empty rectangle in three dimensions
- Triangles of extremal area or perimeter in a finite planar point set
This page was built for publication: On the number of maximum empty boxes amidst \(n\) points
