Bounds for totally separable translative packings in the plane

DOI10.1007/s00454-018-0029-6zbMath1430.52025arXiv1710.06886OpenAlexW2963857248MaRDI QIDQ2283112

Károly Bezdek, Zsolt Lángi

Publication date: 30 December 2019

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.06886

zbMATH Keywords

densitytranslative packingfinite packingtotally separable packing(mixed) areacovering ratioOler's inequalitysoft domainsoft packing

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Erd?s problems and related topics of discrete geometry (52C10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

On generalized Minkowski arrangements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Density bounds for outer parallel domains of unit ball packings
• An inequality in the geometry of numbers
• Note on an inequality of Wegner
• On totally separable packings of equal balls
• Remarks on the closest packing of convex discs
• On the volume of the convex hull of two convex bodies
• The closest packing of convex two-dimensional domains
• Modern developments in the geometry of numbers
• On the densest packing of convex discs
• On the Optimality of the FCC Lattice for Soft Sphere Packing
• On totally separable domains
• Sur la densité des réseaux de domaines convexes