On the Number of Maximum Empty Boxes Amidst n Points

DOI10.4230/LIPICS.SOCG.2016.36zbMATH Open1387.68256OpenAlexW2494755989MaRDI QIDQ3132870

Adrian Dumitrescu, Ming-Hui Jiang

Publication date: 30 January 2018

Full work available at URL: https://dblp.uni-trier.de/db/conf/compgeom/compgeom2016.html#DumitrescuJ16

zbMATH Keywords

approximation algorithmdata miningDavenport-Schinzel sequencemaximum empty box

Mathematics Subject Classification ID

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

Recommendations

• Unnamed Item 👍 👎
• On the number of maximum empty boxes amidst \(n\) points 👍 👎
• On the largest empty axis-parallel box amidst \(n\) points 👍 👎
• On the size of the largest empty box amidst a point set 👍 👎
• On the number of minimal partitions of a box into boxes 👍 👎
• On the number of empty boxes in the Bernoulli sieve I 👍 👎
• Maximal Empty Boxes Amidst Random Points 👍 👎
• Maximal Empty Boxes Amidst Random Points 👍 👎
• Maximum box problem on stochastic points 👍 👎
• Maximum box problem on stochastic points 👍 👎

This page was built for publication: On the Number of Maximum Empty Boxes Amidst n Points