On the largest empty axis-parallel box amidst \(n\) points

DOI10.1007/s00453-012-9635-5zbMath1262.68186OpenAlexW1493107308MaRDI QIDQ1950392

Adrian Dumitrescu, Ming-Hui Jiang

Publication date: 13 May 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9635-5

zbMATH Keywords

approximation algorithmdata miningvan der Corput point setlargest empty boxdiscrepancy of a set of pointsHalton-Hammersley point setlargest empty hypercube

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (29)

Universal discretization ⋮ New bounds on the minimal dispersion ⋮ Minimal dispersion of large volume boxes in the cube ⋮ Deterministic constructions of high-dimensional sets with small dispersion ⋮ On the size of the largest empty box amidst a point set ⋮ A data mining approach for visual and analytical identification of neurorehabilitation ranges in traumatic brain injury cognitive rehabilitation ⋮ Dispersion of digital \((0,m,2)\)-nets ⋮ Connections between numerical integration, discrepancy, dispersion, and universal discretization ⋮ A note on minimal dispersion of point sets in the unit cube ⋮ Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension ⋮ Faster algorithms for largest empty rectangles and boxes ⋮ On the dispersion of sparse grids ⋮ On the largest empty axis-parallel box amidst \(n\) points ⋮ An Upper Bound of the Minimal Dispersion via Delta Covers ⋮ A note on the dispersion of admissible lattices ⋮ Approximation of high-dimensional rank one tensors ⋮ The minimal \(k\)-dispersion of point sets in high dimensions ⋮ On the number of maximum empty boxes amidst \(n\) points ⋮ Anchored rectangle and square packings ⋮ On the fixed volume discrepancy of the Fibonacci sets in the integral norms ⋮ Improved dispersion bounds for modified Fibonacci lattices ⋮ On the fixed volume discrepancy of the Korobov point sets ⋮ On Wegner's inequality for axis-parallel rectangles ⋮ Tractability of the approximation of high-dimensional rank one tensors ⋮ Maximal Empty Boxes Amidst Random Points ⋮ Smooth fixed volume discrepancy, dispersion, and related problems ⋮ Integral norm discretization and related problems ⋮ Large Area Convex Holes in Random Point Sets ⋮ A remark on the minimal dispersion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new algorithm for the largest empty rectangle problem
• On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
• 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
• On two-dimensional Hammersley's sequences
• Mining for empty spaces in large data sets.
• Quasi-Monte-Carlo methods and the dispersion of point sequences
• On the largest empty axis-parallel box amidst \(n\) points
• The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
• Computing the Largest Empty Rectangle
• MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS
• Geometric discrepancy. An illustrated guide
• An efficient algorithm for computing the maximum empty rectangle in three dimensions

This page was built for publication: On the largest empty axis-parallel box amidst \(n\) points