On the Lattice Packings and Coverings of the Plane with Convex Quadrilaterals
Kirati Sriamorn

TL;DR
This paper investigates the lattice packing and covering densities of convex quadrilaterals, including all triangles, determines their optimal lattices, and establishes inequalities relating these densities.
Contribution
It extends known results from triangles to all convex quadrilaterals, explicitly computes densities, identifies optimal lattices, and proves new inequalities between these densities.
Findings
Determined lattice packing density for convex quadrilaterals.
Identified lattices that attain these densities.
Proved inequalities relating packing and covering densities.
Abstract
It is well known that the lattice packing density and the lattice covering density of a triangle are and respectively. We also know that the lattices that attain these densities both are unique. Let and denote the lattice packing density and the lattice covering density of , respectively. In this paper, I study the lattice packings and coverings for a special class of convex disks, which includes all triangles and convex quadrilaterals. In particular, I determine the densities and , where is an arbitrary convex quadrilateral. Furthermore, I also obtain all of lattices that attain these densities. Finally, I show that and , for each convex quadrilateral .
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
TopicsPoint processes and geometric inequalities · Analytic and geometric function theory · Quasicrystal Structures and Properties
