On the lattice point covering problem in dimension 2
Fei Xue
TL;DR
This paper investigates how certain regular polygons in two dimensions can be covered by lattice points, exploring their geometric and combinatorial properties.
Contribution
It introduces new insights into the lattice point covering problem specifically for regular polygons in 2D, expanding understanding of geometric covering properties.
Findings
Identifies conditions under which regular polygons are lattice point coverable
Provides bounds for covering numbers of specific polygons
Enhances theoretical understanding of lattice coverings in 2D
Abstract
In this paper we study the lattice point covering property of some regular polygons in dimension 2.
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.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Optimization and Packing Problems