On Minimal Tilings with Convex Cells Each Containing a Unit Ball

DOI10.1007/978-3-319-00200-2_4zbMATH Open1290.52016OpenAlexW155657234MaRDI QIDQ2848991

Károly Bezdek

Publication date: 13 September 2013

Published in: Discrete Geometry and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-00200-2_4

zbMATH Keywords

tilingsphere packingKepler conjectureconvex cellaverage edge curvatureaverage surface areafoam problem

Mathematics Subject Classification ID

Isoperimetric problems for polytopes (52B60) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Unnamed Item ⋮ Thinning on cell complexes from polygonal tilings

Uses Software

• Flyspeck
• kepler98

Recommendations

• Unnamed Item 👍 👎
• Minimal covers of the Archimedean tilings. I 👍 👎
• On the universal tiling conjecture in dimension one 👍 👎
• Minimal covers of the Archimedean tilings. II. 👍 👎
• On tilings of asymmetric limited-magnitude balls 👍 👎
• Minimum boundary touching tilings of polyominoes 👍 👎
• Minimal Tilings of a Unit Square 👍 👎
• Perimeter-minimizing Tilings by Convex and Non-convex Pentagons 👍 👎
• Tilings with the Minimal Tile Property 👍 👎
• Maximum tilings with the minimal tile property 👍 👎

This page was built for publication: On Minimal Tilings with Convex Cells Each Containing a Unit Ball