A Danzer set for Axis Parallel Boxes
David Simmons, Yaar Solomon

TL;DR
This paper constructs discrete sets in multi-dimensional space that intersect all axis-aligned boxes of volume one, achieving optimal growth rate, which has implications for geometric covering and sampling problems.
Contribution
It provides explicit constructions of Danzer sets in higher dimensions with optimal growth rate, advancing the understanding of geometric set coverage.
Findings
Constructed explicit Danzer sets in $ ^d$ for $d extgreater 1$
Sets intersect all volume-one axis-aligned boxes
Achieved optimal growth rate of $O(T^d)$
Abstract
We present concrete constructions of discrete sets in () that intersect every aligned box of volume in , and which have optimal growth rate .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
