Pessimal packing shapes

DOI10.2140/GT.2015.19.343MaRDI QIDQ2260556zbMATH OpenOpenAlexWikidataFDO

Authors Yoav Kallus

Publication date 11 March 2015

Published in Geometry \& Topology (Search for Journal in Brave)

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

zbMATH Keywords

latticedensityconvex bodypacking

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Abstract: We address the question of which convex shapes, when packed as densely as possible under certain restrictions, fill the least space and leave the most empty space. In each different dimension and under each different set of restrictions, this question is expected to have a different answer or perhaps no answer at all. As the problem of identifying global minima in most cases appears to be beyond current reach, in this paper we focus on local minima. We review some known results and prove these new results: in two dimensions, the regular heptagon is a local minimum of the double-lattice packing density, and in three dimensions, the directional derivative (in the sense of Minkowski addition) of the double-lattice packing density at the point in the space of shapes corresponding to the ball is in every direction positive.

Recommendations

• The local optimality of the double lattice packing
• The 3-ball is a local pessimum for packing
• scientific article; zbMATH DE number 1537578
• When is the ball a local pessimum for covering?
• scientific article; zbMATH DE number 66687

Cites work

• scientific article; zbMATH DE number 783365 (Why is no real title available?)
• scientific article; zbMATH DE number 236540 (Why is no real title available?)
• scientific article; zbMATH DE number 3056572 (Why is no real title available?)
• scientific article; zbMATH DE number 3070539 (Why is no real title available?)
• A Compactness Theorem For Affine Equivalence-Classes of Convex Regions
• A new packing density bound in 3-space
• A proof of the Kepler conjecture
• Convolutions and multiplier transformations of convex bodies
• Dense packing of space with various convex solids
• Dense periodic packings of tetrahedra with small repeating units
• Double-lattice packings of convex bodies in the plane
• Extremal problems and isotropic positions of convex bodies
• On the Lattice Constant of a Symmetric Convex Domain
• On the geometry of numbers
• On the lower bound of packing density for convex bodies in the plane
• Reinhardt's problem of lattice packings of convex domains: Local extremality of the Reinhardt octagon
• Research Problems in Discrete Geometry
• Some basic properties of packing and covering constants
• Sur la densité des réseaux de domaines convexes
• The 3-ball is a local pessimum for packing
• The closest packing of convex two-dimensional domains
• The least dense lattice packing of two‐dimensional convex bodies
• Über die dichteste gitterförmige Lagerung kongruenter Bereiche in der Ebene und eine besondere Art konvexer Kurven

Cited in

(3)

• When is the ball a local pessimum for covering?
• The local optimality of the double lattice packing
• scientific article; zbMATH DE number 3979926 (Why is no real title available?)

Describes a project that uses

Uses Software

• kepler98

This page was built for publication: Pessimal packing shapes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260556)