On the largest empty axis-parallel box amidst \(n\) points
type: Item
instance of: scholarly article
title: On the largest empty axis-parallel box amidst \(n\) points
zbMATH Open document ID: 1262.68186
author: Adrian Dumitrescu
author: Minghui Jiang
published in: Algorithmica
publication date: 2013-05-13T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6162394
zbMATH Keywords: largest empty box
zbMATH Keywords: largest empty hypercube
zbMATH Keywords: discrepancy of a set of points
zbMATH Keywords: van der Corput point set
zbMATH Keywords: Halton-Hammersley point set
zbMATH Keywords: approximation algorithm
zbMATH Keywords: data mining
MaRDI profile type: Publication
full work available at URL: s00453-012-9635-5
OpenAlex ID: W1493107308
cites work: A note on finding a maximum empty rectangle
cites work: An efficient algorithm for maxdominance, with applications
cites work: Q4726347
cites work: The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
cites work: Q4515159
cites work: Computing the Largest Empty Rectangle
cites work: Efficient algorithms for the largest rectangle problem
cites work: An efficient algorithm for computing the maximum empty rectangle in three dimensions
cites work: Mining for empty spaces in large data sets.
cites work: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
cites work: MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS
cites work: Geometric discrepancy. An illustrated guide
cites work: On the maximum empty rectangle problem
cites work: A new algorithm for the largest empty rectangle problem
cites work: Quasi-Monte-Carlo methods and the dispersion of point sequences
cites work: Q4945521
cites work: On two-dimensional Hammersley's sequences
cites work: Q4328327
cites work: Q5762265
DOI: 10.1007/S00453-012-9635-5
description: scientific article; zbMATH DE number 6162394